/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:57:55,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:57:55,871 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:57:55,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:57:55,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:57:55,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:57:55,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:57:55,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:57:55,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:57:55,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:57:55,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:57:55,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:57:55,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:57:55,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:57:55,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:57:55,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:57:55,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:57:55,897 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:57:55,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:57:55,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:57:55,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:57:55,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:57:55,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:57:55,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:57:55,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:57:55,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:57:55,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:57:55,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:57:55,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:57:55,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:57:55,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:57:55,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:57:55,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:57:55,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:57:55,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:57:55,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:57:55,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:57:55,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:57:55,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:57:55,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:57:55,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:57:55,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:57:55,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:57:55,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:57:55,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:57:55,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:57:55,933 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:57:55,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:57:55,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:57:55,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:57:55,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:57:55,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:57:55,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:57:55,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:57:55,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:57:55,935 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:57:55,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:57:55,937 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:57:55,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:57:55,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:57:55,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:57:55,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:57:55,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:57:55,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:57:55,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:57:55,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:57:55,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:57:55,939 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:57:55,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:57:55,940 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:57:55,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:57:55,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:57:56,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:57:56,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:57:56,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:57:56,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:57:56,271 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:57:56,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i [2019-12-18 21:57:56,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8a902c4/01c446f24378477f917d6401901dc06a/FLAGc92d3f672 [2019-12-18 21:57:56,911 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:57:56,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.opt.i [2019-12-18 21:57:56,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8a902c4/01c446f24378477f917d6401901dc06a/FLAGc92d3f672 [2019-12-18 21:57:57,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b8a902c4/01c446f24378477f917d6401901dc06a [2019-12-18 21:57:57,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:57:57,181 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:57:57,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:57:57,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:57:57,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:57:57,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af0a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57, skipping insertion in model container [2019-12-18 21:57:57,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:57:57,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:57:57,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:57:57,764 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:57:57,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:57:57,898 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:57:57,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57 WrapperNode [2019-12-18 21:57:57,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:57:57,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:57:57,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:57:57,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:57:57,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:57:57,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:57:57,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:57:57,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:57:57,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:57,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:58,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... [2019-12-18 21:57:58,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:57:58,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:57:58,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:57:58,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:57:58,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:57:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:57:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:57:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:57:58,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:57:58,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:57:58,088 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:57:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:57:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:57:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:57:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:57:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:57:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:57:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:57:58,094 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:57:58,955 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:57:58,955 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:57:58,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:57:58 BoogieIcfgContainer [2019-12-18 21:57:58,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:57:58,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:57:58,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:57:58,962 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:57:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:57:57" (1/3) ... [2019-12-18 21:57:58,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23536b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:57:58, skipping insertion in model container [2019-12-18 21:57:58,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:57:57" (2/3) ... [2019-12-18 21:57:58,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23536b49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:57:58, skipping insertion in model container [2019-12-18 21:57:58,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:57:58" (3/3) ... [2019-12-18 21:57:58,967 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_tso.opt.i [2019-12-18 21:57:58,977 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:57:58,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:57:58,987 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:57:58,988 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:57:59,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,038 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,038 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,047 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,055 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,056 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,059 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,060 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,061 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,062 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,063 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,064 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,065 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,066 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,067 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,084 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,104 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,111 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,115 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:57:59,141 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:57:59,161 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:57:59,161 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:57:59,161 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:57:59,161 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:57:59,162 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:57:59,162 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:57:59,162 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:57:59,162 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:57:59,179 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 21:57:59,181 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:57:59,304 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:57:59,304 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:57:59,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:57:59,355 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 21:57:59,401 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 21:57:59,402 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:57:59,412 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 21:57:59,433 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 21:57:59,434 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:58:02,415 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-18 21:58:02,815 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 21:58:02,938 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:58:02,967 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-18 21:58:02,967 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 21:58:02,971 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-18 21:58:27,754 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-18 21:58:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-18 21:58:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:58:27,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:27,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:58:27,763 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-18 21:58:27,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:27,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280639470] [2019-12-18 21:58:27,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:27,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280639470] [2019-12-18 21:58:27,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:28,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:58:28,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870069446] [2019-12-18 21:58:28,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:28,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:28,019 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-18 21:58:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:29,290 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-18 21:58:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:29,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:58:29,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:30,124 INFO L225 Difference]: With dead ends: 120110 [2019-12-18 21:58:30,125 INFO L226 Difference]: Without dead ends: 112648 [2019-12-18 21:58:30,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-18 21:58:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-18 21:58:40,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-18 21:58:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-18 21:58:41,355 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-18 21:58:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:41,356 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-18 21:58:41,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:58:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-18 21:58:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:58:41,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:41,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:41,361 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-18 21:58:41,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:41,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979109830] [2019-12-18 21:58:41,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:41,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979109830] [2019-12-18 21:58:41,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:41,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:41,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255064985] [2019-12-18 21:58:41,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:58:41,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:58:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:58:41,476 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-18 21:58:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:46,987 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-18 21:58:46,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:58:46,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:58:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:47,587 INFO L225 Difference]: With dead ends: 175220 [2019-12-18 21:58:47,588 INFO L226 Difference]: Without dead ends: 175171 [2019-12-18 21:58:47,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:58:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-18 21:58:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-18 21:58:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-18 21:58:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-18 21:58:58,571 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-18 21:58:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:58:58,572 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-18 21:58:58,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:58:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-18 21:58:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:58:58,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:58:58,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:58:58,579 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:58:58,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:58:58,580 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-18 21:58:58,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:58:58,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179869827] [2019-12-18 21:58:58,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:58:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:58:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:58:58,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179869827] [2019-12-18 21:58:58,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:58:58,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:58:58,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629850569] [2019-12-18 21:58:58,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:58:58,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:58:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:58:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:58,662 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-18 21:58:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:58:58,799 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-18 21:58:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:58:58,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:58:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:58:58,902 INFO L225 Difference]: With dead ends: 34935 [2019-12-18 21:58:58,902 INFO L226 Difference]: Without dead ends: 34935 [2019-12-18 21:58:58,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:58:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-18 21:58:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-18 21:58:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-18 21:59:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-18 21:59:05,141 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-18 21:59:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:05,142 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-18 21:59:05,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-18 21:59:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:59:05,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:05,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:05,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:05,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-18 21:59:05,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:05,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830431732] [2019-12-18 21:59:05,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:05,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830431732] [2019-12-18 21:59:05,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:05,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:05,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284219087] [2019-12-18 21:59:05,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:05,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,222 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-18 21:59:05,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:05,451 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-18 21:59:05,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:05,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:59:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:05,560 INFO L225 Difference]: With dead ends: 52469 [2019-12-18 21:59:05,561 INFO L226 Difference]: Without dead ends: 52469 [2019-12-18 21:59:05,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-18 21:59:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-18 21:59:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-18 21:59:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-18 21:59:06,426 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-18 21:59:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:06,427 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-18 21:59:06,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-18 21:59:06,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:59:06,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:06,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:06,430 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-18 21:59:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:06,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282930232] [2019-12-18 21:59:06,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:06,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282930232] [2019-12-18 21:59:06,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:06,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:06,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241847420] [2019-12-18 21:59:06,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:06,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:06,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:06,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:06,511 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-18 21:59:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:07,353 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-18 21:59:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:59:07,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:59:07,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:07,455 INFO L225 Difference]: With dead ends: 54128 [2019-12-18 21:59:07,456 INFO L226 Difference]: Without dead ends: 54128 [2019-12-18 21:59:07,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-18 21:59:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-18 21:59:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-18 21:59:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-18 21:59:08,355 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-18 21:59:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:08,356 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-18 21:59:08,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-18 21:59:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:59:08,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:08,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:08,370 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:08,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-18 21:59:08,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:08,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568985838] [2019-12-18 21:59:08,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:08,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568985838] [2019-12-18 21:59:08,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:08,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:08,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589719022] [2019-12-18 21:59:08,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:59:08,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:08,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:59:08,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:08,463 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 6 states. [2019-12-18 21:59:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:09,722 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-18 21:59:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:09,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 21:59:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:09,828 INFO L225 Difference]: With dead ends: 67629 [2019-12-18 21:59:09,829 INFO L226 Difference]: Without dead ends: 67622 [2019-12-18 21:59:09,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:59:10,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-18 21:59:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-18 21:59:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-18 21:59:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-18 21:59:10,723 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-18 21:59:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:10,723 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-18 21:59:10,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:59:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-18 21:59:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:59:10,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:10,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:10,741 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:10,741 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-18 21:59:10,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:10,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668489743] [2019-12-18 21:59:10,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:10,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668489743] [2019-12-18 21:59:10,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:10,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987052876] [2019-12-18 21:59:10,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:10,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:10,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:10,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:10,808 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 4 states. [2019-12-18 21:59:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:10,889 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-18 21:59:10,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:10,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 21:59:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:10,918 INFO L225 Difference]: With dead ends: 18428 [2019-12-18 21:59:10,918 INFO L226 Difference]: Without dead ends: 18428 [2019-12-18 21:59:10,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-18 21:59:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-18 21:59:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-18 21:59:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-18 21:59:11,494 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-18 21:59:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:11,495 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-18 21:59:11,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-18 21:59:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:59:11,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:11,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:11,509 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:11,510 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-18 21:59:11,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:11,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119580301] [2019-12-18 21:59:11,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:11,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119580301] [2019-12-18 21:59:11,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:11,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:11,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412435851] [2019-12-18 21:59:11,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:59:11,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:59:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:11,592 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-18 21:59:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:12,188 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-18 21:59:12,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:59:12,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:59:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:12,226 INFO L225 Difference]: With dead ends: 25507 [2019-12-18 21:59:12,226 INFO L226 Difference]: Without dead ends: 25507 [2019-12-18 21:59:12,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-18 21:59:12,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-18 21:59:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-18 21:59:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-18 21:59:12,617 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-18 21:59:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:12,617 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-18 21:59:12,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:59:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-18 21:59:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:59:12,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:12,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:12,641 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-18 21:59:12,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:12,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999518300] [2019-12-18 21:59:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:12,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999518300] [2019-12-18 21:59:12,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:12,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:59:12,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797463147] [2019-12-18 21:59:12,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:12,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:12,741 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 7 states. [2019-12-18 21:59:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:13,966 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-18 21:59:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:59:13,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:59:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:14,016 INFO L225 Difference]: With dead ends: 28486 [2019-12-18 21:59:14,016 INFO L226 Difference]: Without dead ends: 28486 [2019-12-18 21:59:14,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:59:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-18 21:59:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-18 21:59:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-18 21:59:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-18 21:59:14,591 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-18 21:59:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:14,592 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-18 21:59:14,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-18 21:59:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:59:14,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:14,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:14,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-18 21:59:14,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:14,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964217233] [2019-12-18 21:59:14,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:14,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964217233] [2019-12-18 21:59:14,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:14,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:59:14,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834494600] [2019-12-18 21:59:14,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:14,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:14,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:14,699 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 5 states. [2019-12-18 21:59:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:15,355 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-18 21:59:15,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:59:15,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:59:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:15,420 INFO L225 Difference]: With dead ends: 28283 [2019-12-18 21:59:15,420 INFO L226 Difference]: Without dead ends: 28283 [2019-12-18 21:59:15,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-18 21:59:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-18 21:59:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-18 21:59:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-18 21:59:15,840 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-18 21:59:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:15,840 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-18 21:59:15,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-18 21:59:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:59:15,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:15,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:15,870 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:15,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-18 21:59:15,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:15,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479570139] [2019-12-18 21:59:15,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:15,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479570139] [2019-12-18 21:59:15,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:15,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:15,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265133819] [2019-12-18 21:59:15,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:59:15,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:59:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:15,960 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 5 states. [2019-12-18 21:59:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:16,111 INFO L93 Difference]: Finished difference Result 24998 states and 77951 transitions. [2019-12-18 21:59:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:16,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:59:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:16,172 INFO L225 Difference]: With dead ends: 24998 [2019-12-18 21:59:16,173 INFO L226 Difference]: Without dead ends: 24998 [2019-12-18 21:59:16,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:16,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24998 states. [2019-12-18 21:59:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24998 to 24032. [2019-12-18 21:59:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24032 states. [2019-12-18 21:59:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24032 states to 24032 states and 75345 transitions. [2019-12-18 21:59:16,650 INFO L78 Accepts]: Start accepts. Automaton has 24032 states and 75345 transitions. Word has length 39 [2019-12-18 21:59:16,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:16,651 INFO L462 AbstractCegarLoop]: Abstraction has 24032 states and 75345 transitions. [2019-12-18 21:59:16,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:59:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 24032 states and 75345 transitions. [2019-12-18 21:59:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:59:16,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:16,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:16,676 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:16,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1198798044, now seen corresponding path program 1 times [2019-12-18 21:59:16,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:16,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393475269] [2019-12-18 21:59:16,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:16,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393475269] [2019-12-18 21:59:16,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:16,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:16,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934015787] [2019-12-18 21:59:16,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:16,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:16,803 INFO L87 Difference]: Start difference. First operand 24032 states and 75345 transitions. Second operand 7 states. [2019-12-18 21:59:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:17,444 INFO L93 Difference]: Finished difference Result 67799 states and 211747 transitions. [2019-12-18 21:59:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:59:17,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:59:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:17,526 INFO L225 Difference]: With dead ends: 67799 [2019-12-18 21:59:17,526 INFO L226 Difference]: Without dead ends: 51948 [2019-12-18 21:59:17,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:59:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51948 states. [2019-12-18 21:59:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51948 to 27688. [2019-12-18 21:59:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27688 states. [2019-12-18 21:59:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27688 states to 27688 states and 87532 transitions. [2019-12-18 21:59:18,177 INFO L78 Accepts]: Start accepts. Automaton has 27688 states and 87532 transitions. Word has length 64 [2019-12-18 21:59:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:18,178 INFO L462 AbstractCegarLoop]: Abstraction has 27688 states and 87532 transitions. [2019-12-18 21:59:18,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 27688 states and 87532 transitions. [2019-12-18 21:59:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:59:18,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:18,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:18,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 207970498, now seen corresponding path program 2 times [2019-12-18 21:59:18,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:18,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307088580] [2019-12-18 21:59:18,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:18,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307088580] [2019-12-18 21:59:18,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:18,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:18,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909237092] [2019-12-18 21:59:18,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:18,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:18,322 INFO L87 Difference]: Start difference. First operand 27688 states and 87532 transitions. Second operand 7 states. [2019-12-18 21:59:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:18,892 INFO L93 Difference]: Finished difference Result 76922 states and 238949 transitions. [2019-12-18 21:59:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:59:18,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:59:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:18,974 INFO L225 Difference]: With dead ends: 76922 [2019-12-18 21:59:18,974 INFO L226 Difference]: Without dead ends: 54229 [2019-12-18 21:59:18,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:59:19,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54229 states. [2019-12-18 21:59:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54229 to 32348. [2019-12-18 21:59:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32348 states. [2019-12-18 21:59:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32348 states to 32348 states and 102236 transitions. [2019-12-18 21:59:19,906 INFO L78 Accepts]: Start accepts. Automaton has 32348 states and 102236 transitions. Word has length 64 [2019-12-18 21:59:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:19,906 INFO L462 AbstractCegarLoop]: Abstraction has 32348 states and 102236 transitions. [2019-12-18 21:59:19,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:19,906 INFO L276 IsEmpty]: Start isEmpty. Operand 32348 states and 102236 transitions. [2019-12-18 21:59:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:59:19,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:19,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:19,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:19,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1789319912, now seen corresponding path program 3 times [2019-12-18 21:59:19,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:19,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434708118] [2019-12-18 21:59:19,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:20,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434708118] [2019-12-18 21:59:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:20,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021926008] [2019-12-18 21:59:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:20,045 INFO L87 Difference]: Start difference. First operand 32348 states and 102236 transitions. Second operand 7 states. [2019-12-18 21:59:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:20,561 INFO L93 Difference]: Finished difference Result 65367 states and 203736 transitions. [2019-12-18 21:59:20,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:59:20,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 21:59:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:20,651 INFO L225 Difference]: With dead ends: 65367 [2019-12-18 21:59:20,651 INFO L226 Difference]: Without dead ends: 58008 [2019-12-18 21:59:20,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:59:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58008 states. [2019-12-18 21:59:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58008 to 32656. [2019-12-18 21:59:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32656 states. [2019-12-18 21:59:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32656 states to 32656 states and 103187 transitions. [2019-12-18 21:59:21,751 INFO L78 Accepts]: Start accepts. Automaton has 32656 states and 103187 transitions. Word has length 64 [2019-12-18 21:59:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:21,752 INFO L462 AbstractCegarLoop]: Abstraction has 32656 states and 103187 transitions. [2019-12-18 21:59:21,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 32656 states and 103187 transitions. [2019-12-18 21:59:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 21:59:21,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:21,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:21,786 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 755538776, now seen corresponding path program 4 times [2019-12-18 21:59:21,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:21,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592587257] [2019-12-18 21:59:21,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:21,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592587257] [2019-12-18 21:59:21,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:21,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:21,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386829473] [2019-12-18 21:59:21,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:21,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:21,855 INFO L87 Difference]: Start difference. First operand 32656 states and 103187 transitions. Second operand 3 states. [2019-12-18 21:59:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:22,112 INFO L93 Difference]: Finished difference Result 39410 states and 123345 transitions. [2019-12-18 21:59:22,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:22,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 21:59:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:22,210 INFO L225 Difference]: With dead ends: 39410 [2019-12-18 21:59:22,211 INFO L226 Difference]: Without dead ends: 39410 [2019-12-18 21:59:22,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39410 states. [2019-12-18 21:59:22,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39410 to 34552. [2019-12-18 21:59:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34552 states. [2019-12-18 21:59:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34552 states to 34552 states and 109132 transitions. [2019-12-18 21:59:23,100 INFO L78 Accepts]: Start accepts. Automaton has 34552 states and 109132 transitions. Word has length 64 [2019-12-18 21:59:23,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:23,100 INFO L462 AbstractCegarLoop]: Abstraction has 34552 states and 109132 transitions. [2019-12-18 21:59:23,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 34552 states and 109132 transitions. [2019-12-18 21:59:23,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:23,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:23,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:23,143 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:23,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2009701319, now seen corresponding path program 1 times [2019-12-18 21:59:23,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:23,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346293460] [2019-12-18 21:59:23,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:23,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346293460] [2019-12-18 21:59:23,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:23,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511928322] [2019-12-18 21:59:23,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:23,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:23,197 INFO L87 Difference]: Start difference. First operand 34552 states and 109132 transitions. Second operand 4 states. [2019-12-18 21:59:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:23,761 INFO L93 Difference]: Finished difference Result 53912 states and 170313 transitions. [2019-12-18 21:59:23,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:59:23,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:59:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:23,885 INFO L225 Difference]: With dead ends: 53912 [2019-12-18 21:59:23,885 INFO L226 Difference]: Without dead ends: 53912 [2019-12-18 21:59:23,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53912 states. [2019-12-18 21:59:24,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53912 to 37800. [2019-12-18 21:59:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37800 states. [2019-12-18 21:59:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37800 states to 37800 states and 120622 transitions. [2019-12-18 21:59:24,924 INFO L78 Accepts]: Start accepts. Automaton has 37800 states and 120622 transitions. Word has length 65 [2019-12-18 21:59:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 37800 states and 120622 transitions. [2019-12-18 21:59:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 37800 states and 120622 transitions. [2019-12-18 21:59:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:24,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:24,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:24,972 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 2089376379, now seen corresponding path program 2 times [2019-12-18 21:59:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243222807] [2019-12-18 21:59:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:25,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243222807] [2019-12-18 21:59:25,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:25,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:25,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185623776] [2019-12-18 21:59:25,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:25,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:25,019 INFO L87 Difference]: Start difference. First operand 37800 states and 120622 transitions. Second operand 3 states. [2019-12-18 21:59:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:25,321 INFO L93 Difference]: Finished difference Result 53096 states and 168447 transitions. [2019-12-18 21:59:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:25,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:59:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:25,416 INFO L225 Difference]: With dead ends: 53096 [2019-12-18 21:59:25,416 INFO L226 Difference]: Without dead ends: 53096 [2019-12-18 21:59:25,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53096 states. [2019-12-18 21:59:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53096 to 38139. [2019-12-18 21:59:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38139 states. [2019-12-18 21:59:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38139 states to 38139 states and 121744 transitions. [2019-12-18 21:59:26,135 INFO L78 Accepts]: Start accepts. Automaton has 38139 states and 121744 transitions. Word has length 65 [2019-12-18 21:59:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:26,135 INFO L462 AbstractCegarLoop]: Abstraction has 38139 states and 121744 transitions. [2019-12-18 21:59:26,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38139 states and 121744 transitions. [2019-12-18 21:59:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:26,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:26,180 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:26,180 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1218113347, now seen corresponding path program 3 times [2019-12-18 21:59:26,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:26,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205183117] [2019-12-18 21:59:26,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:26,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205183117] [2019-12-18 21:59:26,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:26,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:59:26,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253078759] [2019-12-18 21:59:26,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:26,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:26,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:26,238 INFO L87 Difference]: Start difference. First operand 38139 states and 121744 transitions. Second operand 4 states. [2019-12-18 21:59:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:26,499 INFO L93 Difference]: Finished difference Result 47614 states and 149860 transitions. [2019-12-18 21:59:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:26,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:59:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:26,571 INFO L225 Difference]: With dead ends: 47614 [2019-12-18 21:59:26,572 INFO L226 Difference]: Without dead ends: 47614 [2019-12-18 21:59:26,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47614 states. [2019-12-18 21:59:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47614 to 38055. [2019-12-18 21:59:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38055 states. [2019-12-18 21:59:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38055 states to 38055 states and 121477 transitions. [2019-12-18 21:59:27,494 INFO L78 Accepts]: Start accepts. Automaton has 38055 states and 121477 transitions. Word has length 65 [2019-12-18 21:59:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:27,495 INFO L462 AbstractCegarLoop]: Abstraction has 38055 states and 121477 transitions. [2019-12-18 21:59:27,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38055 states and 121477 transitions. [2019-12-18 21:59:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:27,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:27,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:27,542 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1789961201, now seen corresponding path program 4 times [2019-12-18 21:59:27,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015256364] [2019-12-18 21:59:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:27,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015256364] [2019-12-18 21:59:27,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:27,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:27,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813042768] [2019-12-18 21:59:27,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:59:27,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:27,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:59:27,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:59:27,631 INFO L87 Difference]: Start difference. First operand 38055 states and 121477 transitions. Second operand 7 states. [2019-12-18 21:59:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:28,238 INFO L93 Difference]: Finished difference Result 80005 states and 251266 transitions. [2019-12-18 21:59:28,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:59:28,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 21:59:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:28,407 INFO L225 Difference]: With dead ends: 80005 [2019-12-18 21:59:28,407 INFO L226 Difference]: Without dead ends: 73765 [2019-12-18 21:59:28,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:59:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73765 states. [2019-12-18 21:59:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73765 to 38119. [2019-12-18 21:59:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38119 states. [2019-12-18 21:59:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38119 states to 38119 states and 121695 transitions. [2019-12-18 21:59:29,636 INFO L78 Accepts]: Start accepts. Automaton has 38119 states and 121695 transitions. Word has length 65 [2019-12-18 21:59:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 38119 states and 121695 transitions. [2019-12-18 21:59:29,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:59:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 38119 states and 121695 transitions. [2019-12-18 21:59:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:29,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:29,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:29,678 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:29,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash 206855563, now seen corresponding path program 5 times [2019-12-18 21:59:29,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:29,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518330366] [2019-12-18 21:59:29,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:29,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518330366] [2019-12-18 21:59:29,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:29,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:59:29,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184338325] [2019-12-18 21:59:29,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:59:29,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:29,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:59:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:59:29,794 INFO L87 Difference]: Start difference. First operand 38119 states and 121695 transitions. Second operand 6 states. [2019-12-18 21:59:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:30,414 INFO L93 Difference]: Finished difference Result 60800 states and 193788 transitions. [2019-12-18 21:59:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:59:30,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 21:59:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:30,508 INFO L225 Difference]: With dead ends: 60800 [2019-12-18 21:59:30,509 INFO L226 Difference]: Without dead ends: 60800 [2019-12-18 21:59:30,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:30,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60800 states. [2019-12-18 21:59:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60800 to 39093. [2019-12-18 21:59:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39093 states. [2019-12-18 21:59:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39093 states to 39093 states and 124695 transitions. [2019-12-18 21:59:31,308 INFO L78 Accepts]: Start accepts. Automaton has 39093 states and 124695 transitions. Word has length 65 [2019-12-18 21:59:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:31,308 INFO L462 AbstractCegarLoop]: Abstraction has 39093 states and 124695 transitions. [2019-12-18 21:59:31,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:59:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 39093 states and 124695 transitions. [2019-12-18 21:59:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:31,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:31,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:31,350 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:31,351 INFO L82 PathProgramCache]: Analyzing trace with hash -217073613, now seen corresponding path program 6 times [2019-12-18 21:59:31,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:31,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995055246] [2019-12-18 21:59:31,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:31,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995055246] [2019-12-18 21:59:31,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:31,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:59:31,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220416744] [2019-12-18 21:59:31,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:59:31,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:59:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:59:31,421 INFO L87 Difference]: Start difference. First operand 39093 states and 124695 transitions. Second operand 4 states. [2019-12-18 21:59:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:31,634 INFO L93 Difference]: Finished difference Result 47014 states and 149097 transitions. [2019-12-18 21:59:31,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:59:31,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 21:59:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:31,706 INFO L225 Difference]: With dead ends: 47014 [2019-12-18 21:59:31,706 INFO L226 Difference]: Without dead ends: 47014 [2019-12-18 21:59:31,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:59:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47014 states. [2019-12-18 21:59:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47014 to 36010. [2019-12-18 21:59:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36010 states. [2019-12-18 21:59:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36010 states to 36010 states and 114136 transitions. [2019-12-18 21:59:32,647 INFO L78 Accepts]: Start accepts. Automaton has 36010 states and 114136 transitions. Word has length 65 [2019-12-18 21:59:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:32,648 INFO L462 AbstractCegarLoop]: Abstraction has 36010 states and 114136 transitions. [2019-12-18 21:59:32,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:59:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 36010 states and 114136 transitions. [2019-12-18 21:59:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:32,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:32,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:32,700 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:32,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1865713068, now seen corresponding path program 1 times [2019-12-18 21:59:32,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:32,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190850130] [2019-12-18 21:59:32,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:32,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190850130] [2019-12-18 21:59:32,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:32,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:59:32,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323286497] [2019-12-18 21:59:32,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:59:32,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:59:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:32,898 INFO L87 Difference]: Start difference. First operand 36010 states and 114136 transitions. Second operand 11 states. [2019-12-18 21:59:36,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:36,156 INFO L93 Difference]: Finished difference Result 68669 states and 212574 transitions. [2019-12-18 21:59:36,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 21:59:36,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 21:59:36,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:36,267 INFO L225 Difference]: With dead ends: 68669 [2019-12-18 21:59:36,267 INFO L226 Difference]: Without dead ends: 68309 [2019-12-18 21:59:36,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 21:59:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68309 states. [2019-12-18 21:59:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68309 to 39224. [2019-12-18 21:59:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39224 states. [2019-12-18 21:59:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39224 states to 39224 states and 124058 transitions. [2019-12-18 21:59:37,446 INFO L78 Accepts]: Start accepts. Automaton has 39224 states and 124058 transitions. Word has length 65 [2019-12-18 21:59:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:37,446 INFO L462 AbstractCegarLoop]: Abstraction has 39224 states and 124058 transitions. [2019-12-18 21:59:37,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:59:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 39224 states and 124058 transitions. [2019-12-18 21:59:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:37,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:37,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:37,493 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:37,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1132128568, now seen corresponding path program 2 times [2019-12-18 21:59:37,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:37,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025347404] [2019-12-18 21:59:37,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:37,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025347404] [2019-12-18 21:59:37,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:37,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:59:37,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954175309] [2019-12-18 21:59:37,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:59:37,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:59:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:37,687 INFO L87 Difference]: Start difference. First operand 39224 states and 124058 transitions. Second operand 11 states. [2019-12-18 21:59:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:39,645 INFO L93 Difference]: Finished difference Result 64749 states and 200632 transitions. [2019-12-18 21:59:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:59:39,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 21:59:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:39,745 INFO L225 Difference]: With dead ends: 64749 [2019-12-18 21:59:39,745 INFO L226 Difference]: Without dead ends: 64623 [2019-12-18 21:59:39,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-12-18 21:59:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64623 states. [2019-12-18 21:59:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64623 to 46071. [2019-12-18 21:59:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46071 states. [2019-12-18 21:59:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46071 states to 46071 states and 144525 transitions. [2019-12-18 21:59:40,622 INFO L78 Accepts]: Start accepts. Automaton has 46071 states and 144525 transitions. Word has length 65 [2019-12-18 21:59:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:40,623 INFO L462 AbstractCegarLoop]: Abstraction has 46071 states and 144525 transitions. [2019-12-18 21:59:40,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:59:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 46071 states and 144525 transitions. [2019-12-18 21:59:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 21:59:40,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:40,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:40,674 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:40,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:40,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1675927358, now seen corresponding path program 3 times [2019-12-18 21:59:40,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:40,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888467953] [2019-12-18 21:59:40,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:40,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888467953] [2019-12-18 21:59:40,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:40,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:40,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871336919] [2019-12-18 21:59:40,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:40,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:40,740 INFO L87 Difference]: Start difference. First operand 46071 states and 144525 transitions. Second operand 3 states. [2019-12-18 21:59:40,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:40,936 INFO L93 Difference]: Finished difference Result 46071 states and 144524 transitions. [2019-12-18 21:59:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:40,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 21:59:40,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:41,007 INFO L225 Difference]: With dead ends: 46071 [2019-12-18 21:59:41,007 INFO L226 Difference]: Without dead ends: 46071 [2019-12-18 21:59:41,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46071 states. [2019-12-18 21:59:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46071 to 37364. [2019-12-18 21:59:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37364 states. [2019-12-18 21:59:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37364 states to 37364 states and 119534 transitions. [2019-12-18 21:59:41,972 INFO L78 Accepts]: Start accepts. Automaton has 37364 states and 119534 transitions. Word has length 65 [2019-12-18 21:59:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:41,973 INFO L462 AbstractCegarLoop]: Abstraction has 37364 states and 119534 transitions. [2019-12-18 21:59:41,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 37364 states and 119534 transitions. [2019-12-18 21:59:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 21:59:42,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:42,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:42,014 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:42,015 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-18 21:59:42,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:42,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240628691] [2019-12-18 21:59:42,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:42,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240628691] [2019-12-18 21:59:42,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:42,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:59:42,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991404332] [2019-12-18 21:59:42,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:59:42,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:42,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:59:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:42,063 INFO L87 Difference]: Start difference. First operand 37364 states and 119534 transitions. Second operand 3 states. [2019-12-18 21:59:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:42,197 INFO L93 Difference]: Finished difference Result 29603 states and 93114 transitions. [2019-12-18 21:59:42,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:59:42,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 21:59:42,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:42,246 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 21:59:42,246 INFO L226 Difference]: Without dead ends: 29603 [2019-12-18 21:59:42,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:59:42,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29603 states. [2019-12-18 21:59:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29603 to 26725. [2019-12-18 21:59:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26725 states. [2019-12-18 21:59:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26725 states to 26725 states and 83906 transitions. [2019-12-18 21:59:42,674 INFO L78 Accepts]: Start accepts. Automaton has 26725 states and 83906 transitions. Word has length 66 [2019-12-18 21:59:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:42,674 INFO L462 AbstractCegarLoop]: Abstraction has 26725 states and 83906 transitions. [2019-12-18 21:59:42,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:59:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26725 states and 83906 transitions. [2019-12-18 21:59:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:59:42,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:42,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:42,705 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:42,705 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-18 21:59:42,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:42,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390903306] [2019-12-18 21:59:42,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:42,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390903306] [2019-12-18 21:59:42,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:42,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:59:42,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057284118] [2019-12-18 21:59:42,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:42,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:42,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:42,845 INFO L87 Difference]: Start difference. First operand 26725 states and 83906 transitions. Second operand 10 states. [2019-12-18 21:59:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:44,155 INFO L93 Difference]: Finished difference Result 38060 states and 119161 transitions. [2019-12-18 21:59:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:59:44,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:59:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:44,202 INFO L225 Difference]: With dead ends: 38060 [2019-12-18 21:59:44,202 INFO L226 Difference]: Without dead ends: 30909 [2019-12-18 21:59:44,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:59:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30909 states. [2019-12-18 21:59:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30909 to 27091. [2019-12-18 21:59:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27091 states. [2019-12-18 21:59:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27091 states to 27091 states and 84875 transitions. [2019-12-18 21:59:44,893 INFO L78 Accepts]: Start accepts. Automaton has 27091 states and 84875 transitions. Word has length 67 [2019-12-18 21:59:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:44,893 INFO L462 AbstractCegarLoop]: Abstraction has 27091 states and 84875 transitions. [2019-12-18 21:59:44,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 27091 states and 84875 transitions. [2019-12-18 21:59:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:59:44,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:44,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:44,922 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:44,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-18 21:59:44,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:44,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141671374] [2019-12-18 21:59:44,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:45,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141671374] [2019-12-18 21:59:45,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:45,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:59:45,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375843741] [2019-12-18 21:59:45,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:59:45,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:59:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:59:45,171 INFO L87 Difference]: Start difference. First operand 27091 states and 84875 transitions. Second operand 10 states. [2019-12-18 21:59:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:46,504 INFO L93 Difference]: Finished difference Result 38515 states and 119639 transitions. [2019-12-18 21:59:46,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:59:46,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 21:59:46,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:46,554 INFO L225 Difference]: With dead ends: 38515 [2019-12-18 21:59:46,554 INFO L226 Difference]: Without dead ends: 33176 [2019-12-18 21:59:46,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:59:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33176 states. [2019-12-18 21:59:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33176 to 27676. [2019-12-18 21:59:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27676 states. [2019-12-18 21:59:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27676 states to 27676 states and 86309 transitions. [2019-12-18 21:59:47,017 INFO L78 Accepts]: Start accepts. Automaton has 27676 states and 86309 transitions. Word has length 67 [2019-12-18 21:59:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:47,018 INFO L462 AbstractCegarLoop]: Abstraction has 27676 states and 86309 transitions. [2019-12-18 21:59:47,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:59:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 27676 states and 86309 transitions. [2019-12-18 21:59:47,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:59:47,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:47,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:47,048 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:47,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:47,048 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-18 21:59:47,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:47,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856133271] [2019-12-18 21:59:47,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:47,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856133271] [2019-12-18 21:59:47,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:47,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:59:47,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890288391] [2019-12-18 21:59:47,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:59:47,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:47,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:59:47,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:59:47,195 INFO L87 Difference]: Start difference. First operand 27676 states and 86309 transitions. Second operand 11 states. [2019-12-18 21:59:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:48,656 INFO L93 Difference]: Finished difference Result 36851 states and 114227 transitions. [2019-12-18 21:59:48,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 21:59:48,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 21:59:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:48,702 INFO L225 Difference]: With dead ends: 36851 [2019-12-18 21:59:48,702 INFO L226 Difference]: Without dead ends: 32596 [2019-12-18 21:59:48,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 21:59:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32596 states. [2019-12-18 21:59:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32596 to 27280. [2019-12-18 21:59:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27280 states. [2019-12-18 21:59:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27280 states to 27280 states and 85108 transitions. [2019-12-18 21:59:49,160 INFO L78 Accepts]: Start accepts. Automaton has 27280 states and 85108 transitions. Word has length 67 [2019-12-18 21:59:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:49,160 INFO L462 AbstractCegarLoop]: Abstraction has 27280 states and 85108 transitions. [2019-12-18 21:59:49,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:59:49,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27280 states and 85108 transitions. [2019-12-18 21:59:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:59:49,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:49,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:49,190 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:49,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:49,190 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-18 21:59:49,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:49,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174106273] [2019-12-18 21:59:49,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:49,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174106273] [2019-12-18 21:59:49,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:49,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 21:59:49,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585581103] [2019-12-18 21:59:49,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 21:59:49,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 21:59:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:59:49,749 INFO L87 Difference]: Start difference. First operand 27280 states and 85108 transitions. Second operand 17 states. [2019-12-18 21:59:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:59:52,147 INFO L93 Difference]: Finished difference Result 34516 states and 106716 transitions. [2019-12-18 21:59:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 21:59:52,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 21:59:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:59:52,193 INFO L225 Difference]: With dead ends: 34516 [2019-12-18 21:59:52,193 INFO L226 Difference]: Without dead ends: 32290 [2019-12-18 21:59:52,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 21:59:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32290 states. [2019-12-18 21:59:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32290 to 29927. [2019-12-18 21:59:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29927 states. [2019-12-18 21:59:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29927 states to 29927 states and 93234 transitions. [2019-12-18 21:59:52,650 INFO L78 Accepts]: Start accepts. Automaton has 29927 states and 93234 transitions. Word has length 67 [2019-12-18 21:59:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:59:52,650 INFO L462 AbstractCegarLoop]: Abstraction has 29927 states and 93234 transitions. [2019-12-18 21:59:52,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 21:59:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29927 states and 93234 transitions. [2019-12-18 21:59:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 21:59:52,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:59:52,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:59:52,681 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:59:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:59:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-18 21:59:52,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:59:52,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471955929] [2019-12-18 21:59:52,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:59:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:59:53,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:59:53,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471955929] [2019-12-18 21:59:53,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:59:53,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:59:53,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517302920] [2019-12-18 21:59:53,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:59:53,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:59:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:59:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:59:53,248 INFO L87 Difference]: Start difference. First operand 29927 states and 93234 transitions. Second operand 18 states. [2019-12-18 22:00:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:01,681 INFO L93 Difference]: Finished difference Result 60548 states and 184965 transitions. [2019-12-18 22:00:01,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-18 22:00:01,681 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 22:00:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:01,754 INFO L225 Difference]: With dead ends: 60548 [2019-12-18 22:00:01,755 INFO L226 Difference]: Without dead ends: 52497 [2019-12-18 22:00:01,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2911 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1053, Invalid=7877, Unknown=0, NotChecked=0, Total=8930 [2019-12-18 22:00:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52497 states. [2019-12-18 22:00:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52497 to 31810. [2019-12-18 22:00:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31810 states. [2019-12-18 22:00:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31810 states to 31810 states and 98473 transitions. [2019-12-18 22:00:02,381 INFO L78 Accepts]: Start accepts. Automaton has 31810 states and 98473 transitions. Word has length 67 [2019-12-18 22:00:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:02,382 INFO L462 AbstractCegarLoop]: Abstraction has 31810 states and 98473 transitions. [2019-12-18 22:00:02,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 22:00:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31810 states and 98473 transitions. [2019-12-18 22:00:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:00:02,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:02,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:02,414 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1883446901, now seen corresponding path program 6 times [2019-12-18 22:00:02,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:02,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88338261] [2019-12-18 22:00:02,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:02,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88338261] [2019-12-18 22:00:02,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:02,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:00:02,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323186583] [2019-12-18 22:00:02,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:00:02,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:02,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:00:02,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:00:02,578 INFO L87 Difference]: Start difference. First operand 31810 states and 98473 transitions. Second operand 11 states. [2019-12-18 22:00:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:04,644 INFO L93 Difference]: Finished difference Result 43980 states and 134894 transitions. [2019-12-18 22:00:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:00:04,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 22:00:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:04,696 INFO L225 Difference]: With dead ends: 43980 [2019-12-18 22:00:04,696 INFO L226 Difference]: Without dead ends: 36927 [2019-12-18 22:00:04,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:00:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36927 states. [2019-12-18 22:00:05,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36927 to 30321. [2019-12-18 22:00:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30321 states. [2019-12-18 22:00:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30321 states to 30321 states and 93739 transitions. [2019-12-18 22:00:05,558 INFO L78 Accepts]: Start accepts. Automaton has 30321 states and 93739 transitions. Word has length 67 [2019-12-18 22:00:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:05,558 INFO L462 AbstractCegarLoop]: Abstraction has 30321 states and 93739 transitions. [2019-12-18 22:00:05,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:00:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 30321 states and 93739 transitions. [2019-12-18 22:00:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:00:05,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:05,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:05,592 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:05,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:05,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1208603803, now seen corresponding path program 7 times [2019-12-18 22:00:05,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:05,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709570797] [2019-12-18 22:00:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:05,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709570797] [2019-12-18 22:00:05,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:05,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:00:05,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666215944] [2019-12-18 22:00:05,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:00:05,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:00:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:00:05,806 INFO L87 Difference]: Start difference. First operand 30321 states and 93739 transitions. Second operand 11 states. [2019-12-18 22:00:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:06,951 INFO L93 Difference]: Finished difference Result 56177 states and 174184 transitions. [2019-12-18 22:00:06,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 22:00:06,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 22:00:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:07,015 INFO L225 Difference]: With dead ends: 56177 [2019-12-18 22:00:07,015 INFO L226 Difference]: Without dead ends: 43822 [2019-12-18 22:00:07,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=808, Unknown=0, NotChecked=0, Total=992 [2019-12-18 22:00:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43822 states. [2019-12-18 22:00:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43822 to 26083. [2019-12-18 22:00:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26083 states. [2019-12-18 22:00:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26083 states to 26083 states and 80869 transitions. [2019-12-18 22:00:07,548 INFO L78 Accepts]: Start accepts. Automaton has 26083 states and 80869 transitions. Word has length 67 [2019-12-18 22:00:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:07,549 INFO L462 AbstractCegarLoop]: Abstraction has 26083 states and 80869 transitions. [2019-12-18 22:00:07,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:00:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 26083 states and 80869 transitions. [2019-12-18 22:00:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:00:07,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:07,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:07,578 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:07,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 8 times [2019-12-18 22:00:07,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:07,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523715935] [2019-12-18 22:00:07,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:00:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:00:07,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523715935] [2019-12-18 22:00:07,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:00:07,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:00:07,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746706815] [2019-12-18 22:00:07,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:00:07,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:00:07,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:00:07,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:00:07,727 INFO L87 Difference]: Start difference. First operand 26083 states and 80869 transitions. Second operand 12 states. [2019-12-18 22:00:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:00:08,638 INFO L93 Difference]: Finished difference Result 43979 states and 136447 transitions. [2019-12-18 22:00:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 22:00:08,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 22:00:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:00:08,702 INFO L225 Difference]: With dead ends: 43979 [2019-12-18 22:00:08,703 INFO L226 Difference]: Without dead ends: 43492 [2019-12-18 22:00:08,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 22:00:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43492 states. [2019-12-18 22:00:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43492 to 25807. [2019-12-18 22:00:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25807 states. [2019-12-18 22:00:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25807 states to 25807 states and 80179 transitions. [2019-12-18 22:00:09,245 INFO L78 Accepts]: Start accepts. Automaton has 25807 states and 80179 transitions. Word has length 67 [2019-12-18 22:00:09,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:00:09,245 INFO L462 AbstractCegarLoop]: Abstraction has 25807 states and 80179 transitions. [2019-12-18 22:00:09,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:00:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 25807 states and 80179 transitions. [2019-12-18 22:00:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:00:09,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:00:09,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:00:09,275 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:00:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:00:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 9 times [2019-12-18 22:00:09,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:00:09,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815760424] [2019-12-18 22:00:09,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:00:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:00:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:00:09,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:00:09,376 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:00:09,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1582~0.base_21|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1582~0.base_21| 4)) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= |v_ULTIMATE.start_main_~#t1582~0.offset_16| 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1582~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1582~0.base_21|) |v_ULTIMATE.start_main_~#t1582~0.offset_16| 0)) |v_#memory_int_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1582~0.base_21|) 0) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1582~0.base_21| 1)) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ULTIMATE.start_main_~#t1583~0.base=|v_ULTIMATE.start_main_~#t1583~0.base_19|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1584~0.base=|v_ULTIMATE.start_main_~#t1584~0.base_19|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1584~0.offset=|v_ULTIMATE.start_main_~#t1584~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1583~0.offset=|v_ULTIMATE.start_main_~#t1583~0.offset_13|, ULTIMATE.start_main_~#t1582~0.base=|v_ULTIMATE.start_main_~#t1582~0.base_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ULTIMATE.start_main_~#t1582~0.offset=|v_ULTIMATE.start_main_~#t1582~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1583~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1584~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1584~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1583~0.offset, ULTIMATE.start_main_~#t1582~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1582~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:00:09,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1583~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1583~0.base_11|) |v_ULTIMATE.start_main_~#t1583~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1583~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1583~0.base_11| 0)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1583~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1583~0.base_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1583~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1583~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1583~0.base=|v_ULTIMATE.start_main_~#t1583~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, ULTIMATE.start_main_~#t1583~0.offset=|v_ULTIMATE.start_main_~#t1583~0.offset_9|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1583~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1583~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:00:09,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:00:09,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In121985488 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In121985488 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out121985488| ~z$w_buff1~0_In121985488)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out121985488| ~z~0_In121985488) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In121985488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121985488, ~z$w_buff1~0=~z$w_buff1~0_In121985488, ~z~0=~z~0_In121985488} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out121985488|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In121985488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121985488, ~z$w_buff1~0=~z$w_buff1~0_In121985488, ~z~0=~z~0_In121985488} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 22:00:09,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 22:00:09,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1584~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1584~0.base_13|) |v_ULTIMATE.start_main_~#t1584~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1584~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1584~0.base_13|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1584~0.base_13|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1584~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1584~0.base_13| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1584~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1584~0.base=|v_ULTIMATE.start_main_~#t1584~0.base_13|, ULTIMATE.start_main_~#t1584~0.offset=|v_ULTIMATE.start_main_~#t1584~0.offset_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1584~0.base, ULTIMATE.start_main_~#t1584~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 22:00:09,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1803618888 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1803618888 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1803618888 |P1Thread1of1ForFork2_#t~ite11_Out-1803618888|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1803618888|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1803618888, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1803618888} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1803618888, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1803618888|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1803618888} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:00:09,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In495516835 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In495516835 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In495516835 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In495516835 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In495516835 |P1Thread1of1ForFork2_#t~ite12_Out495516835|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out495516835|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In495516835, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In495516835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In495516835, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In495516835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In495516835, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In495516835, ~z$w_buff1_used~0=~z$w_buff1_used~0_In495516835, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out495516835|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In495516835} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 22:00:09,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-770443067 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-770443067 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-770443067 |P1Thread1of1ForFork2_#t~ite13_Out-770443067|)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-770443067| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-770443067, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770443067} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-770443067, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-770443067|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-770443067} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 22:00:09,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In821286798 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out821286798| ~z$w_buff0_used~0_In821286798) (= |P2Thread1of1ForFork0_#t~ite26_In821286798| |P2Thread1of1ForFork0_#t~ite26_Out821286798|)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out821286798| ~z$w_buff0_used~0_In821286798) (= |P2Thread1of1ForFork0_#t~ite27_Out821286798| |P2Thread1of1ForFork0_#t~ite26_Out821286798|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In821286798 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In821286798 256)) (and (= (mod ~z$w_buff1_used~0_In821286798 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In821286798 256) 0))))))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In821286798|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821286798, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821286798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821286798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821286798, ~weak$$choice2~0=~weak$$choice2~0_In821286798} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out821286798|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out821286798|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821286798, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821286798, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821286798, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821286798, ~weak$$choice2~0=~weak$$choice2~0_In821286798} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 22:00:09,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:00:09,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-462645675 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-462645675 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-462645675| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-462645675 |P0Thread1of1ForFork1_#t~ite5_Out-462645675|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-462645675, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-462645675} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-462645675|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-462645675, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-462645675} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 22:00:09,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 22:00:09,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out1727442309| |P2Thread1of1ForFork0_#t~ite39_Out1727442309|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1727442309 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1727442309 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out1727442309| ~z$w_buff1~0_In1727442309) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1727442309| ~z~0_In1727442309) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1727442309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1727442309, ~z$w_buff1~0=~z$w_buff1~0_In1727442309, ~z~0=~z~0_In1727442309} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1727442309|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1727442309|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1727442309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1727442309, ~z$w_buff1~0=~z$w_buff1~0_In1727442309, ~z~0=~z~0_In1727442309} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 22:00:09,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1477736940 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1477736940 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1477736940 |P2Thread1of1ForFork0_#t~ite40_Out1477736940|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1477736940|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1477736940, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1477736940} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1477736940, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1477736940|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1477736940} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 22:00:09,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1493659628 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1493659628 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1493659628 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1493659628 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1493659628|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1493659628 |P2Thread1of1ForFork0_#t~ite41_Out1493659628|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1493659628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1493659628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1493659628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1493659628} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1493659628, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1493659628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1493659628, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1493659628, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1493659628|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 22:00:09,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-223563633 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-223563633 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-223563633| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-223563633| ~z$r_buff0_thd3~0_In-223563633) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-223563633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-223563633} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-223563633, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-223563633, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-223563633|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 22:00:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1587142159 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1587142159 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1587142159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1587142159 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1587142159 |P2Thread1of1ForFork0_#t~ite43_Out-1587142159|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1587142159|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1587142159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587142159, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1587142159} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1587142159|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587142159, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1587142159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587142159, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1587142159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 22:00:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 22:00:09,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1489881932 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1489881932 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1489881932 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1489881932 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1489881932|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1489881932| ~z$w_buff1_used~0_In-1489881932) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489881932, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489881932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489881932, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489881932} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1489881932, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1489881932|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1489881932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1489881932, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1489881932} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 22:00:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1762115332 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1762115332 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1762115332)) (and (= ~z$r_buff0_thd1~0_In-1762115332 ~z$r_buff0_thd1~0_Out-1762115332) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1762115332, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1762115332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1762115332, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1762115332|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1762115332} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:00:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-354702341 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-354702341 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-354702341 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-354702341 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-354702341|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In-354702341 |P0Thread1of1ForFork1_#t~ite8_Out-354702341|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-354702341, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-354702341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354702341, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-354702341} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-354702341|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-354702341, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-354702341, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354702341, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-354702341} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 22:00:09,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:00:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1624572549 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1624572549 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1624572549 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1624572549 256)))) (or (and (= ~z$r_buff1_thd2~0_In1624572549 |P1Thread1of1ForFork2_#t~ite14_Out1624572549|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1624572549|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1624572549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1624572549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624572549, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1624572549} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1624572549, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1624572549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1624572549, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1624572549|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1624572549} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:00:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 22:00:09,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:00:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out772942079| |ULTIMATE.start_main_#t~ite47_Out772942079|)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In772942079 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In772942079 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out772942079| ~z$w_buff1~0_In772942079) .cse1 (not .cse2)) (and .cse1 (= |ULTIMATE.start_main_#t~ite47_Out772942079| ~z~0_In772942079) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772942079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772942079, ~z$w_buff1~0=~z$w_buff1~0_In772942079, ~z~0=~z~0_In772942079} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772942079, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out772942079|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772942079, ~z$w_buff1~0=~z$w_buff1~0_In772942079, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out772942079|, ~z~0=~z~0_In772942079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:00:09,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1699827279 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1699827279 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out1699827279| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out1699827279| ~z$w_buff0_used~0_In1699827279) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1699827279, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1699827279, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1699827279, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1699827279|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 22:00:09,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1726931493 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1726931493 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1726931493 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1726931493 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1726931493|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1726931493 |ULTIMATE.start_main_#t~ite50_Out-1726931493|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1726931493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726931493, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1726931493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726931493} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1726931493|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1726931493, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726931493, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1726931493, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726931493} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 22:00:09,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1613765561 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1613765561 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1613765561| ~z$r_buff0_thd0~0_In-1613765561) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-1613765561| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1613765561, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1613765561} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1613765561, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1613765561|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1613765561} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 22:00:09,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-321939567 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-321939567 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-321939567 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-321939567 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-321939567|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-321939567 |ULTIMATE.start_main_#t~ite52_Out-321939567|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-321939567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-321939567, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-321939567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-321939567} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-321939567|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-321939567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-321939567, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-321939567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-321939567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 22:00:09,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:00:09,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:00:09 BasicIcfg [2019-12-18 22:00:09,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:00:09,485 INFO L168 Benchmark]: Toolchain (without parser) took 132305.95 ms. Allocated memory was 141.6 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 97.6 MB in the beginning and 986.9 MB in the end (delta: -889.3 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,486 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.48 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 97.2 MB in the beginning and 150.9 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 199.2 MB. Free memory was 150.9 MB in the beginning and 148.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,487 INFO L168 Benchmark]: Boogie Preprocessor took 46.37 ms. Allocated memory is still 199.2 MB. Free memory was 148.0 MB in the beginning and 145.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,487 INFO L168 Benchmark]: RCFGBuilder took 948.99 ms. Allocated memory is still 199.2 MB. Free memory was 145.8 MB in the beginning and 95.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,488 INFO L168 Benchmark]: TraceAbstraction took 130525.86 ms. Allocated memory was 199.2 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 94.5 MB in the beginning and 986.9 MB in the end (delta: -892.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 22:00:09,490 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.48 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 97.2 MB in the beginning and 150.9 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.39 ms. Allocated memory is still 199.2 MB. Free memory was 150.9 MB in the beginning and 148.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.37 ms. Allocated memory is still 199.2 MB. Free memory was 148.0 MB in the beginning and 145.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 948.99 ms. Allocated memory is still 199.2 MB. Free memory was 145.8 MB in the beginning and 95.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130525.86 ms. Allocated memory was 199.2 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 94.5 MB in the beginning and 986.9 MB in the end (delta: -892.4 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1582, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1583, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1584, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 130.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 45.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8350 SDtfs, 11123 SDslu, 34349 SDs, 0 SdLazy, 25036 SolverSat, 570 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 73 SyntacticMatches, 23 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4342 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 398751 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1654 ConstructedInterpolants, 0 QuantifiedInterpolants, 405780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...