/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:15:19,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:15:19,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:15:19,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:15:19,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:15:19,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:15:19,110 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:15:19,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:15:19,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:15:19,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:15:19,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:15:19,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:15:19,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:15:19,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:15:19,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:15:19,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:15:19,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:15:19,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:15:19,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:15:19,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:15:19,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:15:19,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:15:19,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:15:19,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:15:19,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:15:19,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:15:19,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:15:19,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:15:19,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:15:19,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:15:19,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:15:19,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:15:19,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:15:19,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:15:19,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:15:19,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:15:19,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:15:19,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:15:19,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:15:19,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:15:19,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:15:19,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:15:19,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:15:19,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:15:19,175 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:15:19,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:15:19,176 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:15:19,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:15:19,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:15:19,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:15:19,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:15:19,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:15:19,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:15:19,177 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:15:19,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:15:19,178 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:15:19,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:15:19,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:15:19,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:15:19,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:15:19,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:15:19,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:15:19,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:15:19,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:15:19,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:15:19,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:15:19,180 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:15:19,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:15:19,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:15:19,180 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:15:19,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:15:19,181 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:15:19,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:15:19,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:15:19,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:15:19,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:15:19,475 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:15:19,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 20:15:19,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f31e698/4b20f46de6b5409080a4c32140db47d5/FLAG100c8f088 [2019-12-18 20:15:20,090 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:15:20,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-18 20:15:20,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f31e698/4b20f46de6b5409080a4c32140db47d5/FLAG100c8f088 [2019-12-18 20:15:20,362 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f31e698/4b20f46de6b5409080a4c32140db47d5 [2019-12-18 20:15:20,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:15:20,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:15:20,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:15:20,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:15:20,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:15:20,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:15:20" (1/1) ... [2019-12-18 20:15:20,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637331f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:20, skipping insertion in model container [2019-12-18 20:15:20,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:15:20" (1/1) ... [2019-12-18 20:15:20,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:15:20,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:15:20,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:15:21,001 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:15:21,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:15:21,188 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:15:21,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21 WrapperNode [2019-12-18 20:15:21,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:15:21,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:15:21,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:15:21,190 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:15:21,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:15:21,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:15:21,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:15:21,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:15:21,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (1/1) ... [2019-12-18 20:15:21,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:15:21,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:15:21,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:15:21,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:15:21,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (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 20:15:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:15:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:15:21,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:15:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:15:21,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:15:21,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:15:21,369 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:15:21,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:15:21,370 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:15:21,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:15:21,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:15:21,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:15:21,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:15:21,374 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 20:15:22,216 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:15:22,217 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:15:22,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:15:22 BoogieIcfgContainer [2019-12-18 20:15:22,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:15:22,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:15:22,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:15:22,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:15:22,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:15:20" (1/3) ... [2019-12-18 20:15:22,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30acf6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:15:22, skipping insertion in model container [2019-12-18 20:15:22,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:15:21" (2/3) ... [2019-12-18 20:15:22,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30acf6ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:15:22, skipping insertion in model container [2019-12-18 20:15:22,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:15:22" (3/3) ... [2019-12-18 20:15:22,232 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-18 20:15:22,242 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:15:22,243 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:15:22,254 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:15:22,255 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:15:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,296 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,325 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:15:22,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:15:22,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:15:22,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:15:22,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:15:22,416 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:15:22,416 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:15:22,416 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:15:22,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:15:22,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:15:22,433 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-18 20:15:22,435 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 20:15:22,542 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 20:15:22,542 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:15:22,566 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:15:22,595 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-18 20:15:22,689 INFO L126 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-18 20:15:22,690 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:15:22,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:15:22,723 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 20:15:22,724 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:15:26,228 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 20:15:26,395 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:15:26,429 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-18 20:15:26,429 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 20:15:26,433 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-18 20:15:53,308 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-18 20:15:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-18 20:15:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:15:53,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:15:53,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:15:53,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:15:53,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:15:53,322 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-18 20:15:53,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:15:53,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61467849] [2019-12-18 20:15:53,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:15:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:15:53,565 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 20:15:53,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61467849] [2019-12-18 20:15:53,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:15:53,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:15:53,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092111385] [2019-12-18 20:15:53,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:15:53,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:15:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:15:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:15:53,584 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-18 20:15:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:15:58,441 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-18 20:15:58,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:15:58,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:15:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:15:59,195 INFO L225 Difference]: With dead ends: 137016 [2019-12-18 20:15:59,195 INFO L226 Difference]: Without dead ends: 128980 [2019-12-18 20:15:59,197 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 20:16:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-18 20:16:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-18 20:16:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-18 20:16:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-18 20:16:08,948 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-18 20:16:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:08,948 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-18 20:16:08,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-18 20:16:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:16:08,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:08,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:08,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-18 20:16:08,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:08,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805381363] [2019-12-18 20:16:08,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:09,063 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 20:16:09,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805381363] [2019-12-18 20:16:09,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:09,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:09,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366722700] [2019-12-18 20:16:09,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:09,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:09,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:09,069 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-18 20:16:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:14,498 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-18 20:16:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:16:14,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:16:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:16,135 INFO L225 Difference]: With dead ends: 200378 [2019-12-18 20:16:16,135 INFO L226 Difference]: Without dead ends: 200329 [2019-12-18 20:16:16,136 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 20:16:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-18 20:16:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-18 20:16:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-18 20:16:33,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-18 20:16:33,910 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-18 20:16:33,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:33,911 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-18 20:16:33,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-18 20:16:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:16:33,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:33,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:33,919 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-18 20:16:33,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:33,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779069563] [2019-12-18 20:16:33,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:33,987 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 20:16:33,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779069563] [2019-12-18 20:16:33,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:33,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:33,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142402995] [2019-12-18 20:16:33,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:33,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:33,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:33,990 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-18 20:16:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:34,141 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-18 20:16:34,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:34,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:16:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:34,208 INFO L225 Difference]: With dead ends: 38211 [2019-12-18 20:16:34,208 INFO L226 Difference]: Without dead ends: 38211 [2019-12-18 20:16:34,208 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 20:16:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-18 20:16:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-18 20:16:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-18 20:16:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-18 20:16:40,438 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-18 20:16:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:40,438 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-18 20:16:40,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-18 20:16:40,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:16:40,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:40,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:40,442 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-18 20:16:40,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:40,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968204157] [2019-12-18 20:16:40,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:40,540 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 20:16:40,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968204157] [2019-12-18 20:16:40,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:40,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:40,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303791261] [2019-12-18 20:16:40,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:40,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:40,543 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-18 20:16:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:41,064 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-18 20:16:41,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:16:41,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:16:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:41,201 INFO L225 Difference]: With dead ends: 52954 [2019-12-18 20:16:41,201 INFO L226 Difference]: Without dead ends: 52954 [2019-12-18 20:16:41,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:16:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-18 20:16:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-18 20:16:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-18 20:16:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-18 20:16:42,685 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-18 20:16:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:42,686 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-18 20:16:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-18 20:16:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:16:42,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:42,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:42,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-18 20:16:42,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:42,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87963924] [2019-12-18 20:16:42,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:42,848 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 20:16:42,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87963924] [2019-12-18 20:16:42,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:42,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:16:42,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337206200] [2019-12-18 20:16:42,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:16:42,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:42,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:16:42,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:16:42,851 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 7 states. [2019-12-18 20:16:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:44,111 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-18 20:16:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:16:44,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 20:16:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:44,247 INFO L225 Difference]: With dead ends: 72804 [2019-12-18 20:16:44,247 INFO L226 Difference]: Without dead ends: 72790 [2019-12-18 20:16:44,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-18 20:16:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-18 20:16:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-18 20:16:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-18 20:16:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-18 20:16:45,255 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-18 20:16:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:45,255 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-18 20:16:45,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:16:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-18 20:16:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:16:45,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:45,273 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 20:16:45,273 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:45,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-18 20:16:45,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:45,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232158029] [2019-12-18 20:16:45,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:45,330 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 20:16:45,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232158029] [2019-12-18 20:16:45,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:45,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:45,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399046896] [2019-12-18 20:16:45,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:16:45,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:45,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:16:45,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:16:45,332 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 4 states. [2019-12-18 20:16:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:45,422 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-18 20:16:45,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:16:45,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:16:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:45,459 INFO L225 Difference]: With dead ends: 18102 [2019-12-18 20:16:45,460 INFO L226 Difference]: Without dead ends: 18102 [2019-12-18 20:16:45,460 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 20:16:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-18 20:16:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-18 20:16:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-18 20:16:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-18 20:16:46,293 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-18 20:16:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:46,293 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-18 20:16:46,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:16:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-18 20:16:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:16:46,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:46,308 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 20:16:46,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:46,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:46,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-18 20:16:46,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:46,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795821279] [2019-12-18 20:16:46,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:46,397 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 20:16:46,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795821279] [2019-12-18 20:16:46,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:46,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:16:46,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465270995] [2019-12-18 20:16:46,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:16:46,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:16:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:16:46,400 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-18 20:16:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:47,047 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-18 20:16:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:16:47,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 20:16:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:47,087 INFO L225 Difference]: With dead ends: 25666 [2019-12-18 20:16:47,087 INFO L226 Difference]: Without dead ends: 25666 [2019-12-18 20:16:47,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:16:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-18 20:16:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-18 20:16:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-18 20:16:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-18 20:16:47,455 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-18 20:16:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:47,456 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-18 20:16:47,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:16:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-18 20:16:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:16:47,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:47,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:47,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:47,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-18 20:16:47,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:47,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236276393] [2019-12-18 20:16:47,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:47,571 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 20:16:47,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236276393] [2019-12-18 20:16:47,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:47,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:47,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497757035] [2019-12-18 20:16:47,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:47,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:47,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:47,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:47,573 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 5 states. [2019-12-18 20:16:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:48,030 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-18 20:16:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:16:48,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-18 20:16:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:48,072 INFO L225 Difference]: With dead ends: 25941 [2019-12-18 20:16:48,072 INFO L226 Difference]: Without dead ends: 25941 [2019-12-18 20:16:48,072 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 20:16:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-18 20:16:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-18 20:16:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-18 20:16:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-18 20:16:48,451 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-18 20:16:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:48,452 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-18 20:16:48,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-18 20:16:48,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:16:48,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:48,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:48,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-18 20:16:48,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:48,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522183189] [2019-12-18 20:16:48,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:48,573 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 20:16:48,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522183189] [2019-12-18 20:16:48,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:48,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:16:48,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449702106] [2019-12-18 20:16:48,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:16:48,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:48,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:16:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:16:48,576 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 8 states. [2019-12-18 20:16:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:50,087 INFO L93 Difference]: Finished difference Result 29973 states and 87406 transitions. [2019-12-18 20:16:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:16:50,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 20:16:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:50,132 INFO L225 Difference]: With dead ends: 29973 [2019-12-18 20:16:50,133 INFO L226 Difference]: Without dead ends: 29973 [2019-12-18 20:16:50,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:16:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29973 states. [2019-12-18 20:16:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29973 to 18923. [2019-12-18 20:16:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18923 states. [2019-12-18 20:16:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18923 states to 18923 states and 56662 transitions. [2019-12-18 20:16:50,775 INFO L78 Accepts]: Start accepts. Automaton has 18923 states and 56662 transitions. Word has length 33 [2019-12-18 20:16:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:50,776 INFO L462 AbstractCegarLoop]: Abstraction has 18923 states and 56662 transitions. [2019-12-18 20:16:50,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:16:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18923 states and 56662 transitions. [2019-12-18 20:16:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:16:50,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:50,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:50,798 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-18 20:16:50,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:50,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082078270] [2019-12-18 20:16:50,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:50,856 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 20:16:50,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082078270] [2019-12-18 20:16:50,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:50,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:16:50,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878327718] [2019-12-18 20:16:50,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:50,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:50,859 INFO L87 Difference]: Start difference. First operand 18923 states and 56662 transitions. Second operand 3 states. [2019-12-18 20:16:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:50,933 INFO L93 Difference]: Finished difference Result 18922 states and 56660 transitions. [2019-12-18 20:16:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:50,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 20:16:50,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:50,964 INFO L225 Difference]: With dead ends: 18922 [2019-12-18 20:16:50,964 INFO L226 Difference]: Without dead ends: 18922 [2019-12-18 20:16:50,964 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 20:16:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2019-12-18 20:16:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18922. [2019-12-18 20:16:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-18 20:16:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 56660 transitions. [2019-12-18 20:16:51,248 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 56660 transitions. Word has length 39 [2019-12-18 20:16:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:51,248 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 56660 transitions. [2019-12-18 20:16:51,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 56660 transitions. [2019-12-18 20:16:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:16:51,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:51,267 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] [2019-12-18 20:16:51,267 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-18 20:16:51,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:51,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316410862] [2019-12-18 20:16:51,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:51,367 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 20:16:51,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316410862] [2019-12-18 20:16:51,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:51,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:16:51,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660741016] [2019-12-18 20:16:51,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:16:51,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:51,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:16:51,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:16:51,369 INFO L87 Difference]: Start difference. First operand 18922 states and 56660 transitions. Second operand 6 states. [2019-12-18 20:16:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:52,314 INFO L93 Difference]: Finished difference Result 37537 states and 112068 transitions. [2019-12-18 20:16:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:16:52,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 20:16:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:52,369 INFO L225 Difference]: With dead ends: 37537 [2019-12-18 20:16:52,369 INFO L226 Difference]: Without dead ends: 37537 [2019-12-18 20:16:52,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:16:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37537 states. [2019-12-18 20:16:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37537 to 23985. [2019-12-18 20:16:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23985 states. [2019-12-18 20:16:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 71737 transitions. [2019-12-18 20:16:52,858 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 71737 transitions. Word has length 40 [2019-12-18 20:16:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:52,859 INFO L462 AbstractCegarLoop]: Abstraction has 23985 states and 71737 transitions. [2019-12-18 20:16:52,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:16:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 71737 transitions. [2019-12-18 20:16:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:16:52,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:52,884 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] [2019-12-18 20:16:52,884 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1919201076, now seen corresponding path program 2 times [2019-12-18 20:16:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:52,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812786404] [2019-12-18 20:16:52,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:52,991 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 20:16:52,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812786404] [2019-12-18 20:16:52,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:52,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:16:52,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670450885] [2019-12-18 20:16:52,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:52,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:52,994 INFO L87 Difference]: Start difference. First operand 23985 states and 71737 transitions. Second operand 5 states. [2019-12-18 20:16:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:53,952 INFO L93 Difference]: Finished difference Result 32203 states and 96114 transitions. [2019-12-18 20:16:53,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:16:53,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 20:16:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:54,002 INFO L225 Difference]: With dead ends: 32203 [2019-12-18 20:16:54,002 INFO L226 Difference]: Without dead ends: 32203 [2019-12-18 20:16:54,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 20:16:54,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32203 states. [2019-12-18 20:16:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32203 to 28899. [2019-12-18 20:16:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28899 states. [2019-12-18 20:16:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28899 states to 28899 states and 86897 transitions. [2019-12-18 20:16:54,469 INFO L78 Accepts]: Start accepts. Automaton has 28899 states and 86897 transitions. Word has length 40 [2019-12-18 20:16:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:54,469 INFO L462 AbstractCegarLoop]: Abstraction has 28899 states and 86897 transitions. [2019-12-18 20:16:54,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 28899 states and 86897 transitions. [2019-12-18 20:16:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 20:16:54,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:54,514 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] [2019-12-18 20:16:54,514 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1859885306, now seen corresponding path program 3 times [2019-12-18 20:16:54,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:54,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769622808] [2019-12-18 20:16:54,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:54,614 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 20:16:54,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769622808] [2019-12-18 20:16:54,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:54,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:16:54,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731555581] [2019-12-18 20:16:54,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:54,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:54,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:54,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:54,617 INFO L87 Difference]: Start difference. First operand 28899 states and 86897 transitions. Second operand 3 states. [2019-12-18 20:16:54,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:54,756 INFO L93 Difference]: Finished difference Result 28818 states and 86645 transitions. [2019-12-18 20:16:54,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:54,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 20:16:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:54,819 INFO L225 Difference]: With dead ends: 28818 [2019-12-18 20:16:54,819 INFO L226 Difference]: Without dead ends: 28818 [2019-12-18 20:16:54,819 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 20:16:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-18 20:16:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 24592. [2019-12-18 20:16:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24592 states. [2019-12-18 20:16:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24592 states to 24592 states and 74947 transitions. [2019-12-18 20:16:55,444 INFO L78 Accepts]: Start accepts. Automaton has 24592 states and 74947 transitions. Word has length 40 [2019-12-18 20:16:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:55,445 INFO L462 AbstractCegarLoop]: Abstraction has 24592 states and 74947 transitions. [2019-12-18 20:16:55,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 24592 states and 74947 transitions. [2019-12-18 20:16:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 20:16:55,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:55,470 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] [2019-12-18 20:16:55,471 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:55,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1927216762, now seen corresponding path program 1 times [2019-12-18 20:16:55,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:55,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186455908] [2019-12-18 20:16:55,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:55,521 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 20:16:55,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186455908] [2019-12-18 20:16:55,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:55,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:16:55,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979168612] [2019-12-18 20:16:55,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:16:55,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:55,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:16:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:55,523 INFO L87 Difference]: Start difference. First operand 24592 states and 74947 transitions. Second operand 5 states. [2019-12-18 20:16:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:55,638 INFO L93 Difference]: Finished difference Result 23362 states and 72210 transitions. [2019-12-18 20:16:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:16:55,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 20:16:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:55,679 INFO L225 Difference]: With dead ends: 23362 [2019-12-18 20:16:55,680 INFO L226 Difference]: Without dead ends: 22051 [2019-12-18 20:16:55,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:16:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22051 states. [2019-12-18 20:16:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22051 to 22051. [2019-12-18 20:16:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-12-18 20:16:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 68868 transitions. [2019-12-18 20:16:56,040 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 68868 transitions. Word has length 41 [2019-12-18 20:16:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:56,040 INFO L462 AbstractCegarLoop]: Abstraction has 22051 states and 68868 transitions. [2019-12-18 20:16:56,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:16:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 68868 transitions. [2019-12-18 20:16:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:16:56,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:56,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:56,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 359338126, now seen corresponding path program 1 times [2019-12-18 20:16:56,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:56,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602485970] [2019-12-18 20:16:56,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:56,116 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 20:16:56,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602485970] [2019-12-18 20:16:56,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:56,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:16:56,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412940452] [2019-12-18 20:16:56,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:16:56,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:16:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:16:56,118 INFO L87 Difference]: Start difference. First operand 22051 states and 68868 transitions. Second operand 3 states. [2019-12-18 20:16:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:56,579 INFO L93 Difference]: Finished difference Result 29595 states and 93088 transitions. [2019-12-18 20:16:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:16:56,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:16:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:56,641 INFO L225 Difference]: With dead ends: 29595 [2019-12-18 20:16:56,641 INFO L226 Difference]: Without dead ends: 29595 [2019-12-18 20:16:56,641 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 20:16:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29595 states. [2019-12-18 20:16:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29595 to 23831. [2019-12-18 20:16:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23831 states. [2019-12-18 20:16:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23831 states to 23831 states and 75499 transitions. [2019-12-18 20:16:57,064 INFO L78 Accepts]: Start accepts. Automaton has 23831 states and 75499 transitions. Word has length 65 [2019-12-18 20:16:57,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:57,065 INFO L462 AbstractCegarLoop]: Abstraction has 23831 states and 75499 transitions. [2019-12-18 20:16:57,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:16:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23831 states and 75499 transitions. [2019-12-18 20:16:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:16:57,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:57,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:57,088 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:57,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1347625235, now seen corresponding path program 1 times [2019-12-18 20:16:57,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:57,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266014044] [2019-12-18 20:16:57,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:57,173 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 20:16:57,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266014044] [2019-12-18 20:16:57,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:57,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:16:57,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035375296] [2019-12-18 20:16:57,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:16:57,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:57,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:16:57,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:16:57,175 INFO L87 Difference]: Start difference. First operand 23831 states and 75499 transitions. Second operand 7 states. [2019-12-18 20:16:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:57,665 INFO L93 Difference]: Finished difference Result 62749 states and 198693 transitions. [2019-12-18 20:16:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:16:57,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:16:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:57,743 INFO L225 Difference]: With dead ends: 62749 [2019-12-18 20:16:57,743 INFO L226 Difference]: Without dead ends: 47750 [2019-12-18 20:16:57,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:16:57,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47750 states. [2019-12-18 20:16:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47750 to 28081. [2019-12-18 20:16:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28081 states. [2019-12-18 20:16:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28081 states to 28081 states and 89069 transitions. [2019-12-18 20:16:58,371 INFO L78 Accepts]: Start accepts. Automaton has 28081 states and 89069 transitions. Word has length 65 [2019-12-18 20:16:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:16:58,371 INFO L462 AbstractCegarLoop]: Abstraction has 28081 states and 89069 transitions. [2019-12-18 20:16:58,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:16:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28081 states and 89069 transitions. [2019-12-18 20:16:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:16:58,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:16:58,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:16:58,405 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:16:58,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:16:58,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1859069805, now seen corresponding path program 2 times [2019-12-18 20:16:58,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:16:58,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11567358] [2019-12-18 20:16:58,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:16:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:16:58,499 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 20:16:58,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11567358] [2019-12-18 20:16:58,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:16:58,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:16:58,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418061026] [2019-12-18 20:16:58,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:16:58,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:16:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:16:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:16:58,501 INFO L87 Difference]: Start difference. First operand 28081 states and 89069 transitions. Second operand 7 states. [2019-12-18 20:16:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:16:59,063 INFO L93 Difference]: Finished difference Result 68805 states and 215395 transitions. [2019-12-18 20:16:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:16:59,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 20:16:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:16:59,144 INFO L225 Difference]: With dead ends: 68805 [2019-12-18 20:16:59,144 INFO L226 Difference]: Without dead ends: 49641 [2019-12-18 20:16:59,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:16:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49641 states. [2019-12-18 20:17:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49641 to 32073. [2019-12-18 20:17:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32073 states. [2019-12-18 20:17:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32073 states to 32073 states and 101393 transitions. [2019-12-18 20:17:00,169 INFO L78 Accepts]: Start accepts. Automaton has 32073 states and 101393 transitions. Word has length 65 [2019-12-18 20:17:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:00,170 INFO L462 AbstractCegarLoop]: Abstraction has 32073 states and 101393 transitions. [2019-12-18 20:17:00,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:17:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 32073 states and 101393 transitions. [2019-12-18 20:17:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:17:00,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:00,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:00,206 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1166151863, now seen corresponding path program 3 times [2019-12-18 20:17:00,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:00,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507766825] [2019-12-18 20:17:00,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:00,302 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 20:17:00,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507766825] [2019-12-18 20:17:00,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:00,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:17:00,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784055276] [2019-12-18 20:17:00,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:17:00,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:17:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:17:00,308 INFO L87 Difference]: Start difference. First operand 32073 states and 101393 transitions. Second operand 8 states. [2019-12-18 20:17:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:01,424 INFO L93 Difference]: Finished difference Result 83655 states and 263314 transitions. [2019-12-18 20:17:01,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:17:01,425 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 20:17:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:01,549 INFO L225 Difference]: With dead ends: 83655 [2019-12-18 20:17:01,549 INFO L226 Difference]: Without dead ends: 74383 [2019-12-18 20:17:01,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:17:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74383 states. [2019-12-18 20:17:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74383 to 32593. [2019-12-18 20:17:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32593 states. [2019-12-18 20:17:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32593 states to 32593 states and 103411 transitions. [2019-12-18 20:17:03,070 INFO L78 Accepts]: Start accepts. Automaton has 32593 states and 103411 transitions. Word has length 65 [2019-12-18 20:17:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:03,070 INFO L462 AbstractCegarLoop]: Abstraction has 32593 states and 103411 transitions. [2019-12-18 20:17:03,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:17:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states and 103411 transitions. [2019-12-18 20:17:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:17:03,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:03,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:03,109 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1738755691, now seen corresponding path program 4 times [2019-12-18 20:17:03,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:03,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017737103] [2019-12-18 20:17:03,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:03,218 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 20:17:03,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017737103] [2019-12-18 20:17:03,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:03,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:03,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419825303] [2019-12-18 20:17:03,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:17:03,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:17:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:03,221 INFO L87 Difference]: Start difference. First operand 32593 states and 103411 transitions. Second operand 9 states. [2019-12-18 20:17:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:04,659 INFO L93 Difference]: Finished difference Result 101882 states and 317043 transitions. [2019-12-18 20:17:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 20:17:04,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:17:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:04,810 INFO L225 Difference]: With dead ends: 101882 [2019-12-18 20:17:04,810 INFO L226 Difference]: Without dead ends: 89306 [2019-12-18 20:17:04,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:17:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89306 states. [2019-12-18 20:17:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89306 to 32629. [2019-12-18 20:17:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32629 states. [2019-12-18 20:17:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32629 states to 32629 states and 103568 transitions. [2019-12-18 20:17:05,857 INFO L78 Accepts]: Start accepts. Automaton has 32629 states and 103568 transitions. Word has length 65 [2019-12-18 20:17:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:05,857 INFO L462 AbstractCegarLoop]: Abstraction has 32629 states and 103568 transitions. [2019-12-18 20:17:05,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:17:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32629 states and 103568 transitions. [2019-12-18 20:17:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:17:05,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:05,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:05,898 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:05,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2043240447, now seen corresponding path program 5 times [2019-12-18 20:17:05,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:05,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632518375] [2019-12-18 20:17:05,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:05,999 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 20:17:05,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632518375] [2019-12-18 20:17:06,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:06,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:06,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255743635] [2019-12-18 20:17:06,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:17:06,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:06,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:17:06,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:06,002 INFO L87 Difference]: Start difference. First operand 32629 states and 103568 transitions. Second operand 9 states. [2019-12-18 20:17:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:07,758 INFO L93 Difference]: Finished difference Result 113630 states and 353091 transitions. [2019-12-18 20:17:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:17:07,758 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 20:17:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:07,928 INFO L225 Difference]: With dead ends: 113630 [2019-12-18 20:17:07,928 INFO L226 Difference]: Without dead ends: 105070 [2019-12-18 20:17:07,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:17:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105070 states. [2019-12-18 20:17:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105070 to 32666. [2019-12-18 20:17:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32666 states. [2019-12-18 20:17:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32666 states to 32666 states and 103730 transitions. [2019-12-18 20:17:09,063 INFO L78 Accepts]: Start accepts. Automaton has 32666 states and 103730 transitions. Word has length 65 [2019-12-18 20:17:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:09,063 INFO L462 AbstractCegarLoop]: Abstraction has 32666 states and 103730 transitions. [2019-12-18 20:17:09,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:17:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32666 states and 103730 transitions. [2019-12-18 20:17:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:17:09,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:09,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:09,099 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -20463533, now seen corresponding path program 6 times [2019-12-18 20:17:09,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:09,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643010320] [2019-12-18 20:17:09,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:09,161 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 20:17:09,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643010320] [2019-12-18 20:17:09,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:09,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:09,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835587538] [2019-12-18 20:17:09,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:09,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:09,162 INFO L87 Difference]: Start difference. First operand 32666 states and 103730 transitions. Second operand 3 states. [2019-12-18 20:17:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:09,355 INFO L93 Difference]: Finished difference Result 38120 states and 120184 transitions. [2019-12-18 20:17:09,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:09,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:17:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:09,412 INFO L225 Difference]: With dead ends: 38120 [2019-12-18 20:17:09,413 INFO L226 Difference]: Without dead ends: 38120 [2019-12-18 20:17:09,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38120 states. [2019-12-18 20:17:10,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38120 to 33450. [2019-12-18 20:17:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33450 states. [2019-12-18 20:17:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33450 states to 33450 states and 106577 transitions. [2019-12-18 20:17:10,417 INFO L78 Accepts]: Start accepts. Automaton has 33450 states and 106577 transitions. Word has length 65 [2019-12-18 20:17:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:10,417 INFO L462 AbstractCegarLoop]: Abstraction has 33450 states and 106577 transitions. [2019-12-18 20:17:10,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 33450 states and 106577 transitions. [2019-12-18 20:17:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:10,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:10,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:10,464 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1278998798, now seen corresponding path program 1 times [2019-12-18 20:17:10,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:10,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507963697] [2019-12-18 20:17:10,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:10,519 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 20:17:10,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507963697] [2019-12-18 20:17:10,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:10,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:17:10,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246853129] [2019-12-18 20:17:10,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:10,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:10,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:10,521 INFO L87 Difference]: Start difference. First operand 33450 states and 106577 transitions. Second operand 4 states. [2019-12-18 20:17:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:10,870 INFO L93 Difference]: Finished difference Result 50231 states and 159658 transitions. [2019-12-18 20:17:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:17:10,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 20:17:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:10,950 INFO L225 Difference]: With dead ends: 50231 [2019-12-18 20:17:10,950 INFO L226 Difference]: Without dead ends: 50231 [2019-12-18 20:17:10,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:17:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50231 states. [2019-12-18 20:17:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50231 to 36246. [2019-12-18 20:17:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36246 states. [2019-12-18 20:17:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36246 states to 36246 states and 116509 transitions. [2019-12-18 20:17:11,702 INFO L78 Accepts]: Start accepts. Automaton has 36246 states and 116509 transitions. Word has length 66 [2019-12-18 20:17:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:11,703 INFO L462 AbstractCegarLoop]: Abstraction has 36246 states and 116509 transitions. [2019-12-18 20:17:11,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:17:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 36246 states and 116509 transitions. [2019-12-18 20:17:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:11,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:11,747 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:11,747 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 438587114, now seen corresponding path program 2 times [2019-12-18 20:17:11,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:11,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357475277] [2019-12-18 20:17:11,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:11,798 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 20:17:11,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357475277] [2019-12-18 20:17:11,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:11,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:17:11,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276991180] [2019-12-18 20:17:11,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:11,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:11,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:11,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:11,800 INFO L87 Difference]: Start difference. First operand 36246 states and 116509 transitions. Second operand 4 states. [2019-12-18 20:17:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:12,055 INFO L93 Difference]: Finished difference Result 44212 states and 140524 transitions. [2019-12-18 20:17:12,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:17:12,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 20:17:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:12,124 INFO L225 Difference]: With dead ends: 44212 [2019-12-18 20:17:12,125 INFO L226 Difference]: Without dead ends: 44212 [2019-12-18 20:17:12,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44212 states. [2019-12-18 20:17:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44212 to 36317. [2019-12-18 20:17:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36317 states. [2019-12-18 20:17:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36317 states to 36317 states and 116799 transitions. [2019-12-18 20:17:13,394 INFO L78 Accepts]: Start accepts. Automaton has 36317 states and 116799 transitions. Word has length 66 [2019-12-18 20:17:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:13,394 INFO L462 AbstractCegarLoop]: Abstraction has 36317 states and 116799 transitions. [2019-12-18 20:17:13,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:17:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36317 states and 116799 transitions. [2019-12-18 20:17:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:13,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:13,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:13,437 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1493977688, now seen corresponding path program 3 times [2019-12-18 20:17:13,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:13,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748189346] [2019-12-18 20:17:13,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:13,541 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 20:17:13,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748189346] [2019-12-18 20:17:13,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:13,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:17:13,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12472077] [2019-12-18 20:17:13,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:17:13,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:17:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:17:13,544 INFO L87 Difference]: Start difference. First operand 36317 states and 116799 transitions. Second operand 8 states. [2019-12-18 20:17:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:14,799 INFO L93 Difference]: Finished difference Result 108826 states and 341914 transitions. [2019-12-18 20:17:14,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 20:17:14,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:17:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:14,967 INFO L225 Difference]: With dead ends: 108826 [2019-12-18 20:17:14,967 INFO L226 Difference]: Without dead ends: 96852 [2019-12-18 20:17:14,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:17:15,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96852 states. [2019-12-18 20:17:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96852 to 36319. [2019-12-18 20:17:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36319 states. [2019-12-18 20:17:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36319 states to 36319 states and 116796 transitions. [2019-12-18 20:17:16,109 INFO L78 Accepts]: Start accepts. Automaton has 36319 states and 116796 transitions. Word has length 66 [2019-12-18 20:17:16,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:16,109 INFO L462 AbstractCegarLoop]: Abstraction has 36319 states and 116796 transitions. [2019-12-18 20:17:16,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:17:16,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36319 states and 116796 transitions. [2019-12-18 20:17:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:16,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:16,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:16,153 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash 183520316, now seen corresponding path program 4 times [2019-12-18 20:17:16,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:16,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013140345] [2019-12-18 20:17:16,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:16,249 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 20:17:16,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013140345] [2019-12-18 20:17:16,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:16,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:16,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358380583] [2019-12-18 20:17:16,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:17:16,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:16,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:17:16,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:16,251 INFO L87 Difference]: Start difference. First operand 36319 states and 116796 transitions. Second operand 9 states. [2019-12-18 20:17:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:18,261 INFO L93 Difference]: Finished difference Result 126434 states and 397052 transitions. [2019-12-18 20:17:18,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 20:17:18,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 20:17:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:18,451 INFO L225 Difference]: With dead ends: 126434 [2019-12-18 20:17:18,451 INFO L226 Difference]: Without dead ends: 114748 [2019-12-18 20:17:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 20:17:18,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114748 states. [2019-12-18 20:17:19,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114748 to 36303. [2019-12-18 20:17:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36303 states. [2019-12-18 20:17:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36303 states to 36303 states and 116611 transitions. [2019-12-18 20:17:19,706 INFO L78 Accepts]: Start accepts. Automaton has 36303 states and 116611 transitions. Word has length 66 [2019-12-18 20:17:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:19,706 INFO L462 AbstractCegarLoop]: Abstraction has 36303 states and 116611 transitions. [2019-12-18 20:17:19,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:17:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 36303 states and 116611 transitions. [2019-12-18 20:17:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:19,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:19,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:19,753 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:19,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1510431144, now seen corresponding path program 5 times [2019-12-18 20:17:19,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:19,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325920094] [2019-12-18 20:17:19,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:19,878 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 20:17:19,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325920094] [2019-12-18 20:17:19,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:19,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:19,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103096758] [2019-12-18 20:17:19,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:17:19,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:17:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:19,881 INFO L87 Difference]: Start difference. First operand 36303 states and 116611 transitions. Second operand 9 states. [2019-12-18 20:17:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:21,634 INFO L93 Difference]: Finished difference Result 142418 states and 447631 transitions. [2019-12-18 20:17:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 20:17:21,634 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 20:17:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:21,858 INFO L225 Difference]: With dead ends: 142418 [2019-12-18 20:17:21,858 INFO L226 Difference]: Without dead ends: 119348 [2019-12-18 20:17:21,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:17:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119348 states. [2019-12-18 20:17:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119348 to 38548. [2019-12-18 20:17:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38548 states. [2019-12-18 20:17:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38548 states to 38548 states and 124737 transitions. [2019-12-18 20:17:23,658 INFO L78 Accepts]: Start accepts. Automaton has 38548 states and 124737 transitions. Word has length 66 [2019-12-18 20:17:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:23,658 INFO L462 AbstractCegarLoop]: Abstraction has 38548 states and 124737 transitions. [2019-12-18 20:17:23,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:17:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 38548 states and 124737 transitions. [2019-12-18 20:17:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:17:23,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:23,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:23,702 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1869416178, now seen corresponding path program 1 times [2019-12-18 20:17:23,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:23,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199419609] [2019-12-18 20:17:23,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:23,760 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 20:17:23,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199419609] [2019-12-18 20:17:23,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:23,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:23,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483569540] [2019-12-18 20:17:23,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:23,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:23,762 INFO L87 Difference]: Start difference. First operand 38548 states and 124737 transitions. Second operand 3 states. [2019-12-18 20:17:23,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:23,929 INFO L93 Difference]: Finished difference Result 30561 states and 97348 transitions. [2019-12-18 20:17:23,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:23,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:17:23,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:24,007 INFO L225 Difference]: With dead ends: 30561 [2019-12-18 20:17:24,008 INFO L226 Difference]: Without dead ends: 30561 [2019-12-18 20:17:24,008 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 20:17:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30561 states. [2019-12-18 20:17:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30561 to 28023. [2019-12-18 20:17:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28023 states. [2019-12-18 20:17:24,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28023 states to 28023 states and 89084 transitions. [2019-12-18 20:17:24,818 INFO L78 Accepts]: Start accepts. Automaton has 28023 states and 89084 transitions. Word has length 66 [2019-12-18 20:17:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:24,818 INFO L462 AbstractCegarLoop]: Abstraction has 28023 states and 89084 transitions. [2019-12-18 20:17:24,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:24,818 INFO L276 IsEmpty]: Start isEmpty. Operand 28023 states and 89084 transitions. [2019-12-18 20:17:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:24,859 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:24,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:24,859 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1833062279, now seen corresponding path program 1 times [2019-12-18 20:17:24,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:24,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594578071] [2019-12-18 20:17:24,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:24,972 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 20:17:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594578071] [2019-12-18 20:17:24,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:24,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:24,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101110213] [2019-12-18 20:17:24,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:17:24,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:24,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:17:24,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:17:24,974 INFO L87 Difference]: Start difference. First operand 28023 states and 89084 transitions. Second operand 9 states. [2019-12-18 20:17:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:26,465 INFO L93 Difference]: Finished difference Result 51324 states and 161649 transitions. [2019-12-18 20:17:26,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:17:26,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 20:17:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:26,530 INFO L225 Difference]: With dead ends: 51324 [2019-12-18 20:17:26,530 INFO L226 Difference]: Without dead ends: 42706 [2019-12-18 20:17:26,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:17:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42706 states. [2019-12-18 20:17:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42706 to 28818. [2019-12-18 20:17:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28818 states. [2019-12-18 20:17:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28818 states to 28818 states and 91068 transitions. [2019-12-18 20:17:27,466 INFO L78 Accepts]: Start accepts. Automaton has 28818 states and 91068 transitions. Word has length 67 [2019-12-18 20:17:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:27,467 INFO L462 AbstractCegarLoop]: Abstraction has 28818 states and 91068 transitions. [2019-12-18 20:17:27,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:17:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 28818 states and 91068 transitions. [2019-12-18 20:17:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:27,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:27,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:27,505 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-18 20:17:27,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:27,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209804507] [2019-12-18 20:17:27,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:27,562 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 20:17:27,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209804507] [2019-12-18 20:17:27,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:27,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:17:27,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987494603] [2019-12-18 20:17:27,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:27,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:27,563 INFO L87 Difference]: Start difference. First operand 28818 states and 91068 transitions. Second operand 4 states. [2019-12-18 20:17:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:27,797 INFO L93 Difference]: Finished difference Result 28818 states and 90844 transitions. [2019-12-18 20:17:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:17:27,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 20:17:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:27,873 INFO L225 Difference]: With dead ends: 28818 [2019-12-18 20:17:27,874 INFO L226 Difference]: Without dead ends: 28818 [2019-12-18 20:17:27,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:17:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-18 20:17:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 23876. [2019-12-18 20:17:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23876 states. [2019-12-18 20:17:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23876 states to 23876 states and 74879 transitions. [2019-12-18 20:17:28,622 INFO L78 Accepts]: Start accepts. Automaton has 23876 states and 74879 transitions. Word has length 67 [2019-12-18 20:17:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:28,623 INFO L462 AbstractCegarLoop]: Abstraction has 23876 states and 74879 transitions. [2019-12-18 20:17:28,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:17:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 23876 states and 74879 transitions. [2019-12-18 20:17:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:28,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:28,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:28,657 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-18 20:17:28,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:28,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099888262] [2019-12-18 20:17:28,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:28,872 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 20:17:28,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099888262] [2019-12-18 20:17:28,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:28,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:28,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183904057] [2019-12-18 20:17:28,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:17:28,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:17:28,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:17:28,879 INFO L87 Difference]: Start difference. First operand 23876 states and 74879 transitions. Second operand 10 states. [2019-12-18 20:17:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:29,917 INFO L93 Difference]: Finished difference Result 46390 states and 144713 transitions. [2019-12-18 20:17:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 20:17:29,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:17:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:29,988 INFO L225 Difference]: With dead ends: 46390 [2019-12-18 20:17:29,988 INFO L226 Difference]: Without dead ends: 44475 [2019-12-18 20:17:29,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-18 20:17:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44475 states. [2019-12-18 20:17:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44475 to 27381. [2019-12-18 20:17:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27381 states. [2019-12-18 20:17:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27381 states to 27381 states and 85851 transitions. [2019-12-18 20:17:30,589 INFO L78 Accepts]: Start accepts. Automaton has 27381 states and 85851 transitions. Word has length 67 [2019-12-18 20:17:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:30,589 INFO L462 AbstractCegarLoop]: Abstraction has 27381 states and 85851 transitions. [2019-12-18 20:17:30,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:17:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27381 states and 85851 transitions. [2019-12-18 20:17:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:30,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:30,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:30,622 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1322343339, now seen corresponding path program 2 times [2019-12-18 20:17:30,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:30,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371052290] [2019-12-18 20:17:30,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:30,790 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 20:17:30,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371052290] [2019-12-18 20:17:30,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:30,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:17:30,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718789261] [2019-12-18 20:17:30,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:17:30,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:30,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:17:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:17:30,792 INFO L87 Difference]: Start difference. First operand 27381 states and 85851 transitions. Second operand 10 states. [2019-12-18 20:17:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:31,971 INFO L93 Difference]: Finished difference Result 45108 states and 140350 transitions. [2019-12-18 20:17:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 20:17:31,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 20:17:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:32,026 INFO L225 Difference]: With dead ends: 45108 [2019-12-18 20:17:32,026 INFO L226 Difference]: Without dead ends: 38197 [2019-12-18 20:17:32,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 20:17:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38197 states. [2019-12-18 20:17:32,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38197 to 23343. [2019-12-18 20:17:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23343 states. [2019-12-18 20:17:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23343 states to 23343 states and 72983 transitions. [2019-12-18 20:17:32,499 INFO L78 Accepts]: Start accepts. Automaton has 23343 states and 72983 transitions. Word has length 67 [2019-12-18 20:17:32,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:32,499 INFO L462 AbstractCegarLoop]: Abstraction has 23343 states and 72983 transitions. [2019-12-18 20:17:32,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:17:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 23343 states and 72983 transitions. [2019-12-18 20:17:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:32,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:32,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:32,525 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:32,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:32,526 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-18 20:17:32,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:32,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815998402] [2019-12-18 20:17:32,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:32,696 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 20:17:32,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815998402] [2019-12-18 20:17:32,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:32,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:17:32,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080747781] [2019-12-18 20:17:32,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:17:32,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:17:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:17:32,698 INFO L87 Difference]: Start difference. First operand 23343 states and 72983 transitions. Second operand 11 states. [2019-12-18 20:17:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:33,795 INFO L93 Difference]: Finished difference Result 40953 states and 127325 transitions. [2019-12-18 20:17:33,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 20:17:33,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:17:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:33,855 INFO L225 Difference]: With dead ends: 40953 [2019-12-18 20:17:33,855 INFO L226 Difference]: Without dead ends: 39934 [2019-12-18 20:17:33,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:17:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39934 states. [2019-12-18 20:17:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39934 to 25853. [2019-12-18 20:17:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25853 states. [2019-12-18 20:17:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25853 states to 25853 states and 80834 transitions. [2019-12-18 20:17:34,398 INFO L78 Accepts]: Start accepts. Automaton has 25853 states and 80834 transitions. Word has length 67 [2019-12-18 20:17:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:34,399 INFO L462 AbstractCegarLoop]: Abstraction has 25853 states and 80834 transitions. [2019-12-18 20:17:34,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:17:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand 25853 states and 80834 transitions. [2019-12-18 20:17:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:34,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:34,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:34,427 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:34,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1906777599, now seen corresponding path program 4 times [2019-12-18 20:17:34,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:34,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196025421] [2019-12-18 20:17:34,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:34,577 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 20:17:34,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196025421] [2019-12-18 20:17:34,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:34,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 20:17:34,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822339017] [2019-12-18 20:17:34,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 20:17:34,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:34,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 20:17:34,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:17:34,579 INFO L87 Difference]: Start difference. First operand 25853 states and 80834 transitions. Second operand 11 states. [2019-12-18 20:17:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:35,518 INFO L93 Difference]: Finished difference Result 40530 states and 125593 transitions. [2019-12-18 20:17:35,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:17:35,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 20:17:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:35,575 INFO L225 Difference]: With dead ends: 40530 [2019-12-18 20:17:35,575 INFO L226 Difference]: Without dead ends: 37232 [2019-12-18 20:17:35,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:17:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37232 states. [2019-12-18 20:17:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37232 to 22900. [2019-12-18 20:17:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22900 states. [2019-12-18 20:17:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22900 states to 22900 states and 71486 transitions. [2019-12-18 20:17:36,512 INFO L78 Accepts]: Start accepts. Automaton has 22900 states and 71486 transitions. Word has length 67 [2019-12-18 20:17:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:36,512 INFO L462 AbstractCegarLoop]: Abstraction has 22900 states and 71486 transitions. [2019-12-18 20:17:36,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 20:17:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22900 states and 71486 transitions. [2019-12-18 20:17:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:36,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:36,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:36,539 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 5 times [2019-12-18 20:17:36,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:36,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231147095] [2019-12-18 20:17:36,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:36,725 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 20:17:36,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231147095] [2019-12-18 20:17:36,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:36,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 20:17:36,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021642949] [2019-12-18 20:17:36,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 20:17:36,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:36,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 20:17:36,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:17:36,727 INFO L87 Difference]: Start difference. First operand 22900 states and 71486 transitions. Second operand 12 states. [2019-12-18 20:17:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:37,594 INFO L93 Difference]: Finished difference Result 37415 states and 115863 transitions. [2019-12-18 20:17:37,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:17:37,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 20:17:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:37,648 INFO L225 Difference]: With dead ends: 37415 [2019-12-18 20:17:37,649 INFO L226 Difference]: Without dead ends: 37200 [2019-12-18 20:17:37,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:17:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37200 states. [2019-12-18 20:17:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37200 to 22724. [2019-12-18 20:17:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22724 states. [2019-12-18 20:17:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 71014 transitions. [2019-12-18 20:17:38,118 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 71014 transitions. Word has length 67 [2019-12-18 20:17:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:38,119 INFO L462 AbstractCegarLoop]: Abstraction has 22724 states and 71014 transitions. [2019-12-18 20:17:38,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 20:17:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 71014 transitions. [2019-12-18 20:17:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:17:38,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:38,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:38,143 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 6 times [2019-12-18 20:17:38,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:38,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221813591] [2019-12-18 20:17:38,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:17:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:17:38,272 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:17:38,272 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:17:38,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= v_~a$r_buff0_thd1~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_25|)) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_25|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_25| 1) |v_#valid_55|) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_25| 4)) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_25|) |v_ULTIMATE.start_main_~#t257~0.offset_19| 0))) (= v_~main$tmp_guard0~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_19|) (= v_~a$r_buff0_thd0~0_21 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_17|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_21|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_19|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_25|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_21|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 20:17:38,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:17:38,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:17:38,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 20:17:38,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In-2141618314 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2141618314 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-2141618314| ~a~0_In-2141618314)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-2141618314| ~a$w_buff1~0_In-2141618314) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-2141618314, ~a$w_buff1~0=~a$w_buff1~0_In-2141618314, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2141618314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141618314} OutVars{~a~0=~a~0_In-2141618314, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-2141618314|, ~a$w_buff1~0=~a$w_buff1~0_In-2141618314, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-2141618314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2141618314} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 20:17:38,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 20:17:38,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-580871855 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-580871855 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-580871855|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-580871855 |P1Thread1of1ForFork2_#t~ite11_Out-580871855|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-580871855, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-580871855} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-580871855, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-580871855, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-580871855|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 20:17:38,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1189934932 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1189934932 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1189934932|)) (and (= ~a$w_buff0_used~0_In-1189934932 |P0Thread1of1ForFork1_#t~ite5_Out-1189934932|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189934932, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1189934932} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1189934932|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1189934932, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1189934932} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 20:17:38,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-2072827565 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-2072827565 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-2072827565 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-2072827565 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-2072827565| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2072827565| ~a$w_buff1_used~0_In-2072827565)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2072827565, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2072827565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2072827565} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2072827565|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2072827565, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2072827565, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2072827565, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2072827565} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 20:17:38,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1539488562 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1539488562 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1539488562 ~a$r_buff0_thd1~0_Out-1539488562)) (and (= 0 ~a$r_buff0_thd1~0_Out-1539488562) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1539488562, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1539488562} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1539488562|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1539488562, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1539488562} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:17:38,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In572672811 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In572672811 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In572672811 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In572672811 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out572672811| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out572672811| ~a$r_buff1_thd1~0_In572672811)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In572672811, ~a$w_buff0_used~0=~a$w_buff0_used~0_In572672811, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In572672811, ~a$w_buff1_used~0=~a$w_buff1_used~0_In572672811} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out572672811|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In572672811, ~a$w_buff0_used~0=~a$w_buff0_used~0_In572672811, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In572672811, ~a$w_buff1_used~0=~a$w_buff1_used~0_In572672811} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 20:17:38,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:17:38,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1262197760 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1262197760| |P2Thread1of1ForFork0_#t~ite20_Out1262197760|) (= |P2Thread1of1ForFork0_#t~ite21_Out1262197760| ~a$w_buff0~0_In1262197760)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1262197760 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In1262197760 256) 0)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1262197760 256))) (= 0 (mod ~a$w_buff0_used~0_In1262197760 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out1262197760| |P2Thread1of1ForFork0_#t~ite21_Out1262197760|) (= |P2Thread1of1ForFork0_#t~ite20_Out1262197760| ~a$w_buff0~0_In1262197760) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1262197760, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1262197760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1262197760, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1262197760, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1262197760, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1262197760|, ~weak$$choice2~0=~weak$$choice2~0_In1262197760} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1262197760|, ~a$w_buff0~0=~a$w_buff0~0_In1262197760, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1262197760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1262197760, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1262197760, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1262197760|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1262197760, ~weak$$choice2~0=~weak$$choice2~0_In1262197760} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 20:17:38,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1518428044 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1518428044 256)))) (or (= (mod ~a$w_buff0_used~0_In1518428044 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In1518428044 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In1518428044 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite26_Out1518428044| ~a$w_buff0_used~0_In1518428044) (= |P2Thread1of1ForFork0_#t~ite26_Out1518428044| |P2Thread1of1ForFork0_#t~ite27_Out1518428044|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1518428044| ~a$w_buff0_used~0_In1518428044) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In1518428044| |P2Thread1of1ForFork0_#t~ite26_Out1518428044|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1518428044|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1518428044, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1518428044, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1518428044, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1518428044, ~weak$$choice2~0=~weak$$choice2~0_In1518428044} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1518428044|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1518428044|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1518428044, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1518428044, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1518428044, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1518428044, ~weak$$choice2~0=~weak$$choice2~0_In1518428044} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 20:17:38,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 20:17:38,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 20:17:38,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In280608620 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In280608620 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out280608620| |P2Thread1of1ForFork0_#t~ite38_Out280608620|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out280608620| ~a$w_buff1~0_In280608620) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out280608620| ~a~0_In280608620) .cse2))) InVars {~a~0=~a~0_In280608620, ~a$w_buff1~0=~a$w_buff1~0_In280608620, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In280608620, ~a$w_buff1_used~0=~a$w_buff1_used~0_In280608620} OutVars{~a~0=~a~0_In280608620, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out280608620|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out280608620|, ~a$w_buff1~0=~a$w_buff1~0_In280608620, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In280608620, ~a$w_buff1_used~0=~a$w_buff1_used~0_In280608620} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 20:17:38,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-196962025 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-196962025 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-196962025|)) (and (= ~a$w_buff0_used~0_In-196962025 |P2Thread1of1ForFork0_#t~ite40_Out-196962025|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-196962025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-196962025} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-196962025|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-196962025, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-196962025} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 20:17:38,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1599506424 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1599506424 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1599506424 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1599506424 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1599506424|)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite41_Out-1599506424| ~a$w_buff1_used~0_In-1599506424) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1599506424, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1599506424, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1599506424, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1599506424} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1599506424, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1599506424, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1599506424, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1599506424, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1599506424|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 20:17:38,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In726300165 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In726300165 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In726300165 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In726300165 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In726300165 |P1Thread1of1ForFork2_#t~ite12_Out726300165|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out726300165|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In726300165, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726300165} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In726300165, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In726300165, ~a$w_buff0_used~0=~a$w_buff0_used~0_In726300165, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out726300165|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In726300165} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 20:17:38,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1122537396 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1122537396 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1122537396|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In-1122537396 |P1Thread1of1ForFork2_#t~ite13_Out-1122537396|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122537396, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1122537396, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1122537396, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1122537396|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 20:17:38,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-935002756 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-935002756 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-935002756 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-935002756 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-935002756| ~a$r_buff1_thd2~0_In-935002756) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out-935002756| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-935002756, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-935002756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-935002756} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-935002756, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-935002756, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-935002756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-935002756, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-935002756|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 20:17:38,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 20:17:38,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1367106453 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1367106453 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1367106453| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out1367106453| ~a$r_buff0_thd3~0_In1367106453)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1367106453, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1367106453} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1367106453, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1367106453, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1367106453|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:17:38,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1600471081 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In1600471081 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1600471081 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1600471081 256) 0))) (or (and (= ~a$r_buff1_thd3~0_In1600471081 |P2Thread1of1ForFork0_#t~ite43_Out1600471081|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1600471081|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1600471081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1600471081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1600471081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1600471081} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1600471081|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1600471081, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1600471081, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1600471081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1600471081} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 20:17:38,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:17:38,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:17:38,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-503489259 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In-503489259 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-503489259| ~a~0_In-503489259) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In-503489259 |ULTIMATE.start_main_#t~ite47_Out-503489259|) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-503489259, ~a$w_buff1~0=~a$w_buff1~0_In-503489259, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-503489259, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-503489259} OutVars{~a~0=~a~0_In-503489259, ~a$w_buff1~0=~a$w_buff1~0_In-503489259, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-503489259|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-503489259, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-503489259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:17:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:17:38,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In586464128 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In586464128 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out586464128|)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In586464128 |ULTIMATE.start_main_#t~ite49_Out586464128|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In586464128, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In586464128} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In586464128, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out586464128|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In586464128} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 20:17:38,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1396805293 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In1396805293 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In1396805293 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1396805293 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1396805293|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1396805293 |ULTIMATE.start_main_#t~ite50_Out1396805293|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1396805293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1396805293, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1396805293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1396805293} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1396805293|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1396805293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1396805293, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1396805293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1396805293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 20:17:38,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1572689172 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1572689172 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1572689172 |ULTIMATE.start_main_#t~ite51_Out-1572689172|)) (and (= 0 |ULTIMATE.start_main_#t~ite51_Out-1572689172|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1572689172, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1572689172} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1572689172|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1572689172, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1572689172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 20:17:38,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In2039642118 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2039642118 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In2039642118 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In2039642118 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In2039642118 |ULTIMATE.start_main_#t~ite52_Out2039642118|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out2039642118|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2039642118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2039642118, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2039642118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2039642118} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2039642118|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2039642118, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2039642118, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2039642118, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2039642118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 20:17:38,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:17:38,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:17:38 BasicIcfg [2019-12-18 20:17:38,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:17:38,469 INFO L168 Benchmark]: Toolchain (without parser) took 138096.48 ms. Allocated memory was 138.9 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,470 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.76 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 156.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,471 INFO L168 Benchmark]: Boogie Preprocessor took 38.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,471 INFO L168 Benchmark]: RCFGBuilder took 929.34 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 100.7 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,472 INFO L168 Benchmark]: TraceAbstraction took 136246.74 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:17:38,474 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.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.76 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 156.6 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.03 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 153.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.34 ms. Allocated memory is still 203.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 929.34 ms. Allocated memory is still 203.4 MB. Free memory was 151.8 MB in the beginning and 100.7 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 136246.74 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 135.8s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9606 SDtfs, 14876 SDslu, 36188 SDs, 0 SdLazy, 13721 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 50 SyntacticMatches, 14 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 649166 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1770 NumberOfCodeBlocks, 1770 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 336149 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...