/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:01:41,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:01:41,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:01:41,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:01:41,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:01:41,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:01:41,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:01:41,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:01:41,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:01:41,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:01:41,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:01:41,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:01:41,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:01:41,080 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:01:41,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:01:41,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:01:41,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:01:41,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:01:41,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:01:41,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:01:41,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:01:41,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:01:41,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:01:41,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:01:41,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:01:41,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:01:41,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:01:41,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:01:41,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:01:41,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:01:41,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:01:41,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:01:41,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:01:41,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:01:41,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:01:41,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:01:41,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:01:41,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:01:41,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:01:41,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:01:41,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:01:41,104 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-SemanticLbe.epf [2019-12-18 18:01:41,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:01:41,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:01:41,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:01:41,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:01:41,128 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:01:41,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:01:41,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:01:41,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:01:41,129 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:01:41,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:01:41,130 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:01:41,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:01:41,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:01:41,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:01:41,131 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:01:41,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:01:41,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:01:41,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:01:41,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:01:41,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:01:41,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:01:41,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:01:41,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:01:41,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:01:41,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:01:41,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:01:41,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:01:41,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:01:41,416 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:01:41,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-18 18:01:41,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1516e1711/851f7083ac0e49b182a35ad1fe3fead4/FLAG77f577f63 [2019-12-18 18:01:41,939 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:01:41,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.oepc.i [2019-12-18 18:01:41,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1516e1711/851f7083ac0e49b182a35ad1fe3fead4/FLAG77f577f63 [2019-12-18 18:01:42,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1516e1711/851f7083ac0e49b182a35ad1fe3fead4 [2019-12-18 18:01:42,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:01:42,229 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:01:42,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:42,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:01:42,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:01:42,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:42,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de7c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42, skipping insertion in model container [2019-12-18 18:01:42,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:42,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:01:42,306 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:01:42,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:42,780 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:01:42,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:01:42,956 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:01:42,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42 WrapperNode [2019-12-18 18:01:42,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:01:42,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:42,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:01:42,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:01:42,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:42,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:01:43,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:01:43,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:01:43,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:01:43,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (1/1) ... [2019-12-18 18:01:43,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:01:43,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:01:43,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:01:43,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:01:43,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (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 18:01:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:01:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:01:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:01:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:01:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:01:43,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:01:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:01:43,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:01:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:01:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:01:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:01:43,199 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 18:01:44,124 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:01:44,124 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:01:44,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:44 BoogieIcfgContainer [2019-12-18 18:01:44,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:01:44,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:01:44,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:01:44,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:01:44,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:01:42" (1/3) ... [2019-12-18 18:01:44,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f7728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:44, skipping insertion in model container [2019-12-18 18:01:44,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:01:42" (2/3) ... [2019-12-18 18:01:44,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2f7728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:01:44, skipping insertion in model container [2019-12-18 18:01:44,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:01:44" (3/3) ... [2019-12-18 18:01:44,133 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_power.oepc.i [2019-12-18 18:01:44,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:01:44,142 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:01:44,152 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:01:44,153 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:01:44,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,200 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,200 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,201 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,201 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,202 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,202 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,212 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,264 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,281 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:01:44,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:01:44,328 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:01:44,328 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:01:44,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:01:44,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:01:44,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:01:44,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:01:44,329 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:01:44,329 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:01:44,351 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 18:01:44,353 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 18:01:44,438 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 18:01:44,438 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:44,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:01:44,477 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 18:01:44,562 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 18:01:44,562 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:01:44,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 18:01:44,590 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 18:01:44,591 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:01:48,867 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:01:48,973 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:01:49,369 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76598 [2019-12-18 18:01:49,370 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 18:01:49,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-18 18:01:49,881 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-18 18:01:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-18 18:01:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:01:49,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:49,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:01:49,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:49,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash 791334, now seen corresponding path program 1 times [2019-12-18 18:01:49,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:49,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852890725] [2019-12-18 18:01:49,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:50,107 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 18:01:50,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852890725] [2019-12-18 18:01:50,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:50,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:01:50,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841818466] [2019-12-18 18:01:50,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:50,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:50,136 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-18 18:01:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:50,409 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-18 18:01:50,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:50,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:01:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:50,492 INFO L225 Difference]: With dead ends: 8506 [2019-12-18 18:01:50,492 INFO L226 Difference]: Without dead ends: 7522 [2019-12-18 18:01:50,494 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 18:01:50,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-18 18:01:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-18 18:01:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-18 18:01:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-18 18:01:50,935 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-18 18:01:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:50,935 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-18 18:01:50,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-18 18:01:50,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:01:50,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:50,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:50,939 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:50,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash -894599256, now seen corresponding path program 1 times [2019-12-18 18:01:50,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:50,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956959298] [2019-12-18 18:01:50,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:50,992 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 18:01:50,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956959298] [2019-12-18 18:01:50,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:50,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:50,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404772419] [2019-12-18 18:01:50,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:50,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:50,996 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-18 18:01:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:51,018 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-18 18:01:51,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:51,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 18:01:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:51,027 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 18:01:51,027 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 18:01:51,028 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 18:01:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 18:01:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 18:01:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 18:01:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-18 18:01:51,061 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-18 18:01:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:51,062 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-18 18:01:51,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-18 18:01:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:01:51,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:51,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:51,064 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash 253726612, now seen corresponding path program 1 times [2019-12-18 18:01:51,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:51,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435048426] [2019-12-18 18:01:51,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:51,229 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 18:01:51,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435048426] [2019-12-18 18:01:51,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:51,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:51,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987850368] [2019-12-18 18:01:51,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:51,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:51,231 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-18 18:01:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:51,309 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-18 18:01:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:51,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 18:01:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:51,321 INFO L225 Difference]: With dead ends: 1960 [2019-12-18 18:01:51,321 INFO L226 Difference]: Without dead ends: 1960 [2019-12-18 18:01:51,322 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 18:01:51,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-18 18:01:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-18 18:01:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-18 18:01:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-18 18:01:51,366 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-18 18:01:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:51,367 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-18 18:01:51,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-18 18:01:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:01:51,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:51,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:51,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash 164472776, now seen corresponding path program 1 times [2019-12-18 18:01:51,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:51,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434691914] [2019-12-18 18:01:51,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:51,450 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 18:01:51,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434691914] [2019-12-18 18:01:51,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:51,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:51,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687963746] [2019-12-18 18:01:51,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:51,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:51,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:51,457 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-18 18:01:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:51,659 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-18 18:01:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:51,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:01:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:51,669 INFO L225 Difference]: With dead ends: 1706 [2019-12-18 18:01:51,669 INFO L226 Difference]: Without dead ends: 1706 [2019-12-18 18:01:51,670 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 18:01:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-18 18:01:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-18 18:01:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-18 18:01:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-18 18:01:51,728 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-18 18:01:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:51,729 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-18 18:01:51,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-18 18:01:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:01:51,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:51,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:01:51,731 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash 930242268, now seen corresponding path program 1 times [2019-12-18 18:01:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:51,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61153885] [2019-12-18 18:01:51,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:51,836 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 18:01:51,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61153885] [2019-12-18 18:01:51,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:51,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:51,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144214216] [2019-12-18 18:01:51,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:51,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:51,839 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-18 18:01:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:52,019 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-18 18:01:52,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:01:52,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:01:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:52,031 INFO L225 Difference]: With dead ends: 2032 [2019-12-18 18:01:52,031 INFO L226 Difference]: Without dead ends: 2032 [2019-12-18 18:01:52,031 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 18:01:52,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-18 18:01:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-18 18:01:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-18 18:01:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-18 18:01:52,076 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-18 18:01:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-18 18:01:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-18 18:01:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:01:52,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:52,079 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 18:01:52,080 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:52,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:52,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1533455323, now seen corresponding path program 1 times [2019-12-18 18:01:52,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:52,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448086600] [2019-12-18 18:01:52,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:52,194 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 18:01:52,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448086600] [2019-12-18 18:01:52,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:52,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:52,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357695320] [2019-12-18 18:01:52,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:52,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:52,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:52,200 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-18 18:01:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:52,466 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-18 18:01:52,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:01:52,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:01:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:52,487 INFO L225 Difference]: With dead ends: 2284 [2019-12-18 18:01:52,488 INFO L226 Difference]: Without dead ends: 2284 [2019-12-18 18:01:52,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-18 18:01:52,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-18 18:01:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-18 18:01:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-18 18:01:52,552 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-18 18:01:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:52,552 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-18 18:01:52,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-18 18:01:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:01:52,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:52,555 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 18:01:52,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash -381413792, now seen corresponding path program 1 times [2019-12-18 18:01:52,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:52,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762887679] [2019-12-18 18:01:52,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:52,631 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 18:01:52,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762887679] [2019-12-18 18:01:52,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:52,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:52,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453175680] [2019-12-18 18:01:52,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:52,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:52,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:52,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:52,634 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-18 18:01:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:52,679 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-18 18:01:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:52,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 18:01:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:52,687 INFO L225 Difference]: With dead ends: 2578 [2019-12-18 18:01:52,688 INFO L226 Difference]: Without dead ends: 2578 [2019-12-18 18:01:52,688 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 18:01:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-18 18:01:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-18 18:01:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-18 18:01:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-18 18:01:52,746 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-18 18:01:52,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:52,747 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-18 18:01:52,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:52,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-18 18:01:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:01:52,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:52,750 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] [2019-12-18 18:01:52,751 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135588, now seen corresponding path program 1 times [2019-12-18 18:01:52,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:52,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132359820] [2019-12-18 18:01:52,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:52,888 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 18:01:52,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132359820] [2019-12-18 18:01:52,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:52,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:52,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852341998] [2019-12-18 18:01:52,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:52,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:52,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:52,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:52,891 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-18 18:01:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:52,916 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-18 18:01:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:52,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 18:01:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:52,927 INFO L225 Difference]: With dead ends: 3111 [2019-12-18 18:01:52,927 INFO L226 Difference]: Without dead ends: 1431 [2019-12-18 18:01:52,927 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 18:01:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-18 18:01:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-18 18:01:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-18 18:01:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-18 18:01:52,972 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-18 18:01:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:52,973 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-18 18:01:52,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-18 18:01:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:01:52,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:52,976 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] [2019-12-18 18:01:52,976 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 501869478, now seen corresponding path program 1 times [2019-12-18 18:01:52,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:52,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878050390] [2019-12-18 18:01:52,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:53,076 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 18:01:53,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878050390] [2019-12-18 18:01:53,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:53,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:53,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962882848] [2019-12-18 18:01:53,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:53,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:53,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:53,078 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-18 18:01:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:53,225 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-18 18:01:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:01:53,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 18:01:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:53,232 INFO L225 Difference]: With dead ends: 1416 [2019-12-18 18:01:53,232 INFO L226 Difference]: Without dead ends: 1416 [2019-12-18 18:01:53,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-18 18:01:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-18 18:01:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-18 18:01:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-18 18:01:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-18 18:01:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:53,264 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-18 18:01:53,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-18 18:01:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:01:53,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:53,268 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 18:01:53,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1828057274, now seen corresponding path program 1 times [2019-12-18 18:01:53,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:53,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059713896] [2019-12-18 18:01:53,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:53,348 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 18:01:53,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059713896] [2019-12-18 18:01:53,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:53,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:01:53,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164242467] [2019-12-18 18:01:53,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:01:53,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:53,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:01:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:01:53,350 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 5 states. [2019-12-18 18:01:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:53,809 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-18 18:01:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:01:53,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:01:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:53,815 INFO L225 Difference]: With dead ends: 2192 [2019-12-18 18:01:53,815 INFO L226 Difference]: Without dead ends: 2192 [2019-12-18 18:01:53,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 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 18:01:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-18 18:01:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-18 18:01:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-18 18:01:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-18 18:01:53,863 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-18 18:01:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:53,863 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-18 18:01:53,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:01:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-18 18:01:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 18:01:53,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:53,871 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] [2019-12-18 18:01:53,871 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:53,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1516082769, now seen corresponding path program 1 times [2019-12-18 18:01:53,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:53,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024707039] [2019-12-18 18:01:53,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:53,929 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 18:01:53,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024707039] [2019-12-18 18:01:53,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:53,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:01:53,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700922307] [2019-12-18 18:01:53,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:01:53,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:01:53,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:01:53,932 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 4 states. [2019-12-18 18:01:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:53,946 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-18 18:01:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:01:53,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 18:01:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:53,949 INFO L225 Difference]: With dead ends: 1109 [2019-12-18 18:01:53,949 INFO L226 Difference]: Without dead ends: 1001 [2019-12-18 18:01:53,949 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 18:01:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-18 18:01:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-18 18:01:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-18 18:01:53,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-18 18:01:53,968 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-18 18:01:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:53,969 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-18 18:01:53,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:01:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-18 18:01:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:01:53,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:53,972 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] [2019-12-18 18:01:53,972 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:53,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1905841279, now seen corresponding path program 1 times [2019-12-18 18:01:53,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923687468] [2019-12-18 18:01:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:54,056 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 18:01:54,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923687468] [2019-12-18 18:01:54,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:54,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:01:54,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740539794] [2019-12-18 18:01:54,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:01:54,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:54,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:01:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:01:54,058 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 7 states. [2019-12-18 18:01:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:54,313 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-18 18:01:54,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:01:54,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 18:01:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:54,316 INFO L225 Difference]: With dead ends: 1593 [2019-12-18 18:01:54,316 INFO L226 Difference]: Without dead ends: 1060 [2019-12-18 18:01:54,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:01:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-18 18:01:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-18 18:01:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-18 18:01:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-18 18:01:54,337 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-18 18:01:54,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:54,338 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-18 18:01:54,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:01:54,338 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-18 18:01:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 18:01:54,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:54,341 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] [2019-12-18 18:01:54,341 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1903876577, now seen corresponding path program 2 times [2019-12-18 18:01:54,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:54,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858811469] [2019-12-18 18:01:54,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:54,471 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 18:01:54,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858811469] [2019-12-18 18:01:54,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:54,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:54,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044723927] [2019-12-18 18:01:54,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:54,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:54,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:54,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:54,473 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 3 states. [2019-12-18 18:01:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:54,524 INFO L93 Difference]: Finished difference Result 1145 states and 2342 transitions. [2019-12-18 18:01:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:54,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 18:01:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:54,527 INFO L225 Difference]: With dead ends: 1145 [2019-12-18 18:01:54,528 INFO L226 Difference]: Without dead ends: 1145 [2019-12-18 18:01:54,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:01:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2019-12-18 18:01:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 931. [2019-12-18 18:01:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-18 18:01:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-18 18:01:54,548 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-18 18:01:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:54,548 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-18 18:01:54,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-18 18:01:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 18:01:54,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:54,551 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] [2019-12-18 18:01:54,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1330853335, now seen corresponding path program 1 times [2019-12-18 18:01:54,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:54,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659813541] [2019-12-18 18:01:54,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:01:54,657 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 18:01:54,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659813541] [2019-12-18 18:01:54,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:01:54,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:01:54,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843972504] [2019-12-18 18:01:54,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:01:54,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:01:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:01:54,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:01:54,659 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 3 states. [2019-12-18 18:01:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:01:54,677 INFO L93 Difference]: Finished difference Result 931 states and 1918 transitions. [2019-12-18 18:01:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:01:54,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 18:01:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:01:54,680 INFO L225 Difference]: With dead ends: 931 [2019-12-18 18:01:54,680 INFO L226 Difference]: Without dead ends: 931 [2019-12-18 18:01:54,680 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 18:01:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-18 18:01:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 814. [2019-12-18 18:01:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-12-18 18:01:54,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1697 transitions. [2019-12-18 18:01:54,697 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1697 transitions. Word has length 52 [2019-12-18 18:01:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:01:54,698 INFO L462 AbstractCegarLoop]: Abstraction has 814 states and 1697 transitions. [2019-12-18 18:01:54,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:01:54,698 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1697 transitions. [2019-12-18 18:01:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 18:01:54,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:01:54,701 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] [2019-12-18 18:01:54,701 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:01:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:01:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1920865598, now seen corresponding path program 1 times [2019-12-18 18:01:54,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:01:54,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687189024] [2019-12-18 18:01:54,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:01:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:01:54,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:01:54,820 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:01:54,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_142 0) (= v_~x$mem_tmp~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31|)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1601~0.base_31|) (= v_~z~0_22 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~__unbuffered_p1_EBX~0_41 0) (= 0 v_~x$w_buff0_used~0_606) (= v_~y~0_95 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$w_buff1~0_160) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1601~0.base_31| 4)) (= v_~x$r_buff1_thd1~0_109 0) (= 0 v_~x$w_buff0~0_251) (= 0 v_~x$r_buff1_thd2~0_196) (= 0 v_~x$read_delayed~0_6) (= 0 |v_ULTIMATE.start_main_~#t1601~0.offset_23|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~x$w_buff1_used~0_306) (= 0 v_~weak$$choice2~0_98) (= 0 v_~weak$$choice0~0_22) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1601~0.base_31| 1)) (= 0 v_~x$r_buff0_thd2~0_279) (= 0 v_~x~0_116) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1601~0.base_31|) |v_ULTIMATE.start_main_~#t1601~0.offset_23| 0))) (= v_~x$flush_delayed~0_30 0) (= v_~x$r_buff0_thd0~0_134 0) (= v_~x$r_buff0_thd1~0_174 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_10|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_251, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_30, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~x$mem_tmp~0=v_~x$mem_tmp~0_23, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_371|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_90|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t1601~0.base=|v_ULTIMATE.start_main_~#t1601~0.base_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_19|, ULTIMATE.start_main_~#t1601~0.offset=|v_ULTIMATE.start_main_~#t1601~0.offset_23|, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_134, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_160, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_306, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_196, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_142, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_279, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_22, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_116, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1602~0.base, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1601~0.base, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1601~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1602~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:01:54,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~x$r_buff1_thd0~0_Out1571776611 ~x$r_buff0_thd0~0_In1571776611) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1571776611)) (= ~x$r_buff1_thd2~0_Out1571776611 ~x$r_buff0_thd2~0_In1571776611) (= ~x$r_buff1_thd1~0_Out1571776611 ~x$r_buff0_thd1~0_In1571776611) (= 1 ~x$r_buff0_thd1~0_Out1571776611) (= 1 ~y~0_Out1571776611)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1571776611, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1571776611, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1571776611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1571776611} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1571776611, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1571776611, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1571776611, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1571776611, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1571776611, ~y~0=~y~0_Out1571776611, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1571776611, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1571776611} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:01:54,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L802-1-->L804: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1602~0.base_11|) |v_ULTIMATE.start_main_~#t1602~0.offset_10| 1)) |v_#memory_int_5|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1602~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1602~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1602~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1602~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1602~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1602~0.base=|v_ULTIMATE.start_main_~#t1602~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1602~0.offset=|v_ULTIMATE.start_main_~#t1602~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1602~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1602~0.offset] because there is no mapped edge [2019-12-18 18:01:54,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In738539306 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In738539306 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out738539306|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In738539306 |P0Thread1of1ForFork0_#t~ite5_Out738539306|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In738539306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In738539306} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out738539306|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In738539306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In738539306} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:01:54,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In76987885 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In76987885 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In76987885 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In76987885 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out76987885|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In76987885 |P0Thread1of1ForFork0_#t~ite6_Out76987885|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76987885, ~x$w_buff1_used~0=~x$w_buff1_used~0_In76987885, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In76987885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76987885} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out76987885|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In76987885, ~x$w_buff1_used~0=~x$w_buff1_used~0_In76987885, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In76987885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In76987885} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:01:54,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In353997700 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In353997700 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out353997700 0)) (and (= ~x$r_buff0_thd1~0_Out353997700 ~x$r_buff0_thd1~0_In353997700) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In353997700, ~x$w_buff0_used~0=~x$w_buff0_used~0_In353997700} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out353997700, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out353997700|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In353997700} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:01:54,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1470717160 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1470717160 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1470717160 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1470717160 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1470717160|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd1~0_In1470717160 |P0Thread1of1ForFork0_#t~ite8_Out1470717160|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1470717160, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1470717160, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1470717160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470717160} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1470717160, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1470717160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1470717160, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1470717160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1470717160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:01:54,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L744-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:01:54,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd2~0_61 v_~x$r_buff0_thd2~0_60)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 18:01:54,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1046636711 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1046636711| |P1Thread1of1ForFork1_#t~ite30_Out1046636711|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1046636711 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1046636711 256) 0)) (= (mod ~x$w_buff0_used~0_In1046636711 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In1046636711 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out1046636711| ~x$r_buff1_thd2~0_In1046636711)) (and (not .cse0) (= ~x$r_buff1_thd2~0_In1046636711 |P1Thread1of1ForFork1_#t~ite30_Out1046636711|) (= |P1Thread1of1ForFork1_#t~ite29_In1046636711| |P1Thread1of1ForFork1_#t~ite29_Out1046636711|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1046636711|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1046636711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1046636711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1046636711, ~weak$$choice2~0=~weak$$choice2~0_In1046636711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1046636711} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1046636711|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1046636711|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1046636711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1046636711, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1046636711, ~weak$$choice2~0=~weak$$choice2~0_In1046636711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1046636711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 18:01:54,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_6 v_~x~0_27) (not (= (mod v_~x$flush_delayed~0_9 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-18 18:01:54,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-166421347 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-166421347 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-166421347| ~x~0_In-166421347)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-166421347| ~x$w_buff1~0_In-166421347)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-166421347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166421347, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-166421347, ~x~0=~x~0_In-166421347} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-166421347, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-166421347, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-166421347, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-166421347|, ~x~0=~x~0_In-166421347} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:01:54,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:01:54,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-243865146 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-243865146 256)))) (or (and (= ~x$w_buff0_used~0_In-243865146 |P1Thread1of1ForFork1_#t~ite34_Out-243865146|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-243865146| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-243865146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-243865146} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-243865146|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-243865146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-243865146} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:01:54,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-404009758 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-404009758 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-404009758 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-404009758 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-404009758| ~x$w_buff1_used~0_In-404009758) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out-404009758| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-404009758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-404009758, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-404009758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-404009758} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-404009758, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-404009758, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-404009758|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-404009758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-404009758} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:01:54,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2041341947 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2041341947 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-2041341947| ~x$r_buff0_thd2~0_In-2041341947) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-2041341947|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2041341947, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041341947} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2041341947, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2041341947|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041341947} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:01:54,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In767836921 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In767836921 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In767836921 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In767836921 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In767836921 |P1Thread1of1ForFork1_#t~ite37_Out767836921|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out767836921|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In767836921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In767836921, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In767836921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In767836921} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In767836921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In767836921, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In767836921, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out767836921|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In767836921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:01:54,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork1_#t~ite37_24|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_91, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:01:54,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 18:01:54,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In754909714 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In754909714 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out754909714| |ULTIMATE.start_main_#t~ite40_Out754909714|))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In754909714 |ULTIMATE.start_main_#t~ite40_Out754909714|) .cse2) (and (= ~x~0_In754909714 |ULTIMATE.start_main_#t~ite40_Out754909714|) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In754909714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In754909714, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In754909714, ~x~0=~x~0_In754909714} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out754909714|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out754909714|, ~x$w_buff1~0=~x$w_buff1~0_In754909714, ~x$w_buff1_used~0=~x$w_buff1_used~0_In754909714, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In754909714, ~x~0=~x~0_In754909714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 18:01:54,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1996399518 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1996399518 256)))) (or (and (= ~x$w_buff0_used~0_In-1996399518 |ULTIMATE.start_main_#t~ite42_Out-1996399518|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1996399518| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1996399518, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1996399518} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1996399518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1996399518|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1996399518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:01:54,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1838517605 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1838517605 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1838517605 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1838517605 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1838517605 |ULTIMATE.start_main_#t~ite43_Out1838517605|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1838517605|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1838517605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1838517605, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1838517605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1838517605} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1838517605, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1838517605, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1838517605|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1838517605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1838517605} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:01:54,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1123171887 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1123171887 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1123171887|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1123171887| ~x$r_buff0_thd0~0_In1123171887)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1123171887, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123171887} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1123171887, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1123171887|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1123171887} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:01:54,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-871000264 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-871000264 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-871000264 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-871000264 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-871000264|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-871000264| ~x$r_buff1_thd0~0_In-871000264) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-871000264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-871000264, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-871000264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871000264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-871000264, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-871000264, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-871000264, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-871000264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-871000264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:01:54,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~x$r_buff1_thd0~0_96 |v_ULTIMATE.start_main_#t~ite45_53|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y~0_57 2) (= v_~__unbuffered_p1_EBX~0_23 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_53|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_57, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_96, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_52|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:01:54,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:01:54 BasicIcfg [2019-12-18 18:01:54,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:01:54,909 INFO L168 Benchmark]: Toolchain (without parser) took 12680.76 ms. Allocated memory was 140.0 MB in the beginning and 427.8 MB in the end (delta: 287.8 MB). Free memory was 103.6 MB in the beginning and 217.5 MB in the end (delta: -113.9 MB). Peak memory consumption was 174.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,910 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.70 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.4 MB in the beginning and 159.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.92 ms. Allocated memory is still 204.5 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,912 INFO L168 Benchmark]: Boogie Preprocessor took 82.55 ms. Allocated memory is still 204.5 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,913 INFO L168 Benchmark]: RCFGBuilder took 1017.88 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,914 INFO L168 Benchmark]: TraceAbstraction took 10780.99 ms. Allocated memory was 204.5 MB in the beginning and 427.8 MB in the end (delta: 223.3 MB). Free memory was 109.7 MB in the beginning and 217.5 MB in the end (delta: -107.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:01:54,918 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.70 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.70 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 103.4 MB in the beginning and 159.4 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.92 ms. Allocated memory is still 204.5 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.55 ms. Allocated memory is still 204.5 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1017.88 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10780.99 ms. Allocated memory was 204.5 MB in the beginning and 427.8 MB in the end (delta: 223.3 MB). Free memory was 109.7 MB in the beginning and 217.5 MB in the end (delta: -107.8 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 25 ChoiceCompositions, 4597 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 76598 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1629 SDtfs, 1045 SDslu, 2400 SDs, 0 SdLazy, 1176 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 2571 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 353 ConstructedInterpolants, 0 QuantifiedInterpolants, 57571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...