/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:25:43,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:25:43,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:25:43,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:25:43,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:25:43,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:25:43,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:25:43,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:25:43,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:25:43,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:25:43,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:25:43,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:25:43,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:25:43,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:25:43,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:25:43,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:25:43,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:25:43,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:25:43,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:25:43,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:25:43,092 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:25:43,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:25:43,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:25:43,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:25:43,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:25:43,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:25:43,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:25:43,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:25:43,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:25:43,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:25:43,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:25:43,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:25:43,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:25:43,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:25:43,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:25:43,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:25:43,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:25:43,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:25:43,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:25:43,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:25:43,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:25:43,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:25:43,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:25:43,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:25:43,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:25:43,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:25:43,152 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:25:43,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:25:43,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:25:43,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:25:43,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:25:43,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:25:43,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:25:43,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:25:43,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:25:43,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:25:43,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:25:43,157 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:25:43,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:25:43,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:25:43,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:25:43,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:25:43,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:25:43,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:25:43,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:25:43,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:25:43,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:25:43,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:25:43,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:25:43,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:25:43,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:25:43,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:25:43,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:25:43,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:25:43,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:25:43,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:25:43,469 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:25:43,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-18 12:25:43,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60f3d679/8dd63e07dd7d4ed9b3c129e626444b45/FLAG79eba549d [2019-12-18 12:25:44,146 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:25:44,147 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_rmo.oepc.i [2019-12-18 12:25:44,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60f3d679/8dd63e07dd7d4ed9b3c129e626444b45/FLAG79eba549d [2019-12-18 12:25:44,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60f3d679/8dd63e07dd7d4ed9b3c129e626444b45 [2019-12-18 12:25:44,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:25:44,407 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:25:44,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:25:44,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:25:44,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:25:44,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:25:44" (1/1) ... [2019-12-18 12:25:44,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:44, skipping insertion in model container [2019-12-18 12:25:44,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:25:44" (1/1) ... [2019-12-18 12:25:44,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:25:44,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:25:45,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:25:45,063 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:25:45,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:25:45,202 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:25:45,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45 WrapperNode [2019-12-18 12:25:45,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:25:45,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:25:45,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:25:45,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:25:45,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:25:45,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:25:45,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:25:45,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:25:45,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (1/1) ... [2019-12-18 12:25:45,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:25:45,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:25:45,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:25:45,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:25:45,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (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 12:25:45,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:25:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:25:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:25:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:25:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:25:45,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:25:45,428 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:25:45,429 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:25:45,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:25:45,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:25:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:25:45,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:25:45,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:25:45,434 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 12:25:46,389 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:25:46,390 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:25:46,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:25:46 BoogieIcfgContainer [2019-12-18 12:25:46,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:25:46,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:25:46,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:25:46,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:25:46,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:25:44" (1/3) ... [2019-12-18 12:25:46,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530cfc7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:25:46, skipping insertion in model container [2019-12-18 12:25:46,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:25:45" (2/3) ... [2019-12-18 12:25:46,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530cfc7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:25:46, skipping insertion in model container [2019-12-18 12:25:46,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:25:46" (3/3) ... [2019-12-18 12:25:46,408 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_rmo.oepc.i [2019-12-18 12:25:46,419 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:25:46,420 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:25:46,430 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:25:46,431 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:25:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,488 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,552 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,570 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,571 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:25:46,591 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:25:46,611 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:25:46,612 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:25:46,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:25:46,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:25:46,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:25:46,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:25:46,612 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:25:46,612 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:25:46,637 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:25:46,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:25:46,749 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:25:46,750 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:25:46,773 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:25:46,800 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:25:46,896 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:25:46,896 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:25:46,907 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:25:46,934 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:25:46,936 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:25:52,242 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:25:52,354 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:25:52,690 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:25:52,845 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:25:52,878 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-18 12:25:52,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 12:25:52,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-18 12:26:13,901 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-18 12:26:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-18 12:26:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:26:13,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:13,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:26:13,910 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 12:26:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-18 12:26:13,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:13,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833082838] [2019-12-18 12:26:13,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:14,151 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 12:26:14,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833082838] [2019-12-18 12:26:14,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:14,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:26:14,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139414350] [2019-12-18 12:26:14,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:14,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:14,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:14,178 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-18 12:26:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:15,704 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-18 12:26:15,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:15,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:26:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:16,461 INFO L225 Difference]: With dead ends: 122174 [2019-12-18 12:26:16,461 INFO L226 Difference]: Without dead ends: 115076 [2019-12-18 12:26:16,462 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 12:26:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-18 12:26:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-18 12:26:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-18 12:26:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-18 12:26:32,897 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-18 12:26:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:32,897 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-18 12:26:32,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-18 12:26:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:26:32,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:32,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:32,904 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 12:26:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:32,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-18 12:26:32,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:32,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89666093] [2019-12-18 12:26:32,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:33,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 12:26:33,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89666093] [2019-12-18 12:26:33,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:33,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:33,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323832317] [2019-12-18 12:26:33,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:26:33,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:26:33,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:26:33,067 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-18 12:26:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:34,275 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-18 12:26:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:26:34,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:26:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:34,787 INFO L225 Difference]: With dead ends: 178684 [2019-12-18 12:26:34,787 INFO L226 Difference]: Without dead ends: 178635 [2019-12-18 12:26:34,792 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 12:26:45,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-18 12:26:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-18 12:26:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-18 12:26:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-18 12:26:56,096 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-18 12:26:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:56,096 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-18 12:26:56,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:26:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-18 12:26:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:26:56,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:56,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:56,110 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 12:26:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-18 12:26:56,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:56,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913349043] [2019-12-18 12:26:56,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:56,193 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 12:26:56,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913349043] [2019-12-18 12:26:56,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:56,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:26:56,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952454747] [2019-12-18 12:26:56,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:26:56,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:26:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:26:56,196 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-18 12:26:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:56,343 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-18 12:26:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:26:56,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:26:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:56,418 INFO L225 Difference]: With dead ends: 34587 [2019-12-18 12:26:56,418 INFO L226 Difference]: Without dead ends: 34587 [2019-12-18 12:26:56,419 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 12:26:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-18 12:26:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-18 12:26:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-18 12:26:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-18 12:26:57,117 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-18 12:26:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:57,117 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-18 12:26:57,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:26:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-18 12:26:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:26:57,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:57,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:26:57,120 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 12:26:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-18 12:26:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:57,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584936053] [2019-12-18 12:26:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:57,248 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 12:26:57,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584936053] [2019-12-18 12:26:57,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:57,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:26:57,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684701753] [2019-12-18 12:26:57,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:26:57,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:57,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:26:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:26:57,252 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-18 12:26:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:26:57,794 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-18 12:26:57,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:26:57,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:26:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:26:57,907 INFO L225 Difference]: With dead ends: 47506 [2019-12-18 12:26:57,907 INFO L226 Difference]: Without dead ends: 47506 [2019-12-18 12:26:57,907 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 12:26:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-18 12:26:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-18 12:26:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-18 12:26:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-18 12:26:59,707 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-18 12:26:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:26:59,708 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-18 12:26:59,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:26:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-18 12:26:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:26:59,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:26:59,717 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 12:26:59,717 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 12:26:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:26:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-18 12:26:59,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:26:59,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074942998] [2019-12-18 12:26:59,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:26:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:26:59,808 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 12:26:59,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074942998] [2019-12-18 12:26:59,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:26:59,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:26:59,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288281970] [2019-12-18 12:26:59,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:26:59,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:26:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:26:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:26:59,811 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-18 12:27:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:00,691 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-18 12:27:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:27:00,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:27:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:00,790 INFO L225 Difference]: With dead ends: 59624 [2019-12-18 12:27:00,790 INFO L226 Difference]: Without dead ends: 59617 [2019-12-18 12:27:00,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:27:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-18 12:27:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-18 12:27:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-18 12:27:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-18 12:27:02,394 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-18 12:27:02,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:02,395 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-18 12:27:02,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:27:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-18 12:27:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:27:02,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:02,408 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 12:27:02,408 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 12:27:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:02,409 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-18 12:27:02,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:02,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377504706] [2019-12-18 12:27:02,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:02,486 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 12:27:02,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377504706] [2019-12-18 12:27:02,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:02,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:02,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134840610] [2019-12-18 12:27:02,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:27:02,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:27:02,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:02,489 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-18 12:27:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:02,573 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-18 12:27:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:27:02,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:27:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:02,603 INFO L225 Difference]: With dead ends: 16096 [2019-12-18 12:27:02,604 INFO L226 Difference]: Without dead ends: 16096 [2019-12-18 12:27:02,604 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 12:27:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-18 12:27:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-18 12:27:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-18 12:27:02,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-18 12:27:02,845 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-18 12:27:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:02,845 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-18 12:27:02,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:27:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-18 12:27:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:27:02,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:02,857 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 12:27:02,857 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 12:27:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-18 12:27:02,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:02,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267639629] [2019-12-18 12:27:02,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:02,948 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 12:27:02,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267639629] [2019-12-18 12:27:02,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:02,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:27:02,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594907018] [2019-12-18 12:27:02,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:27:02,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:27:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:27:02,951 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-18 12:27:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:03,567 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-18 12:27:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:27:03,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:27:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:03,609 INFO L225 Difference]: With dead ends: 22779 [2019-12-18 12:27:03,609 INFO L226 Difference]: Without dead ends: 22779 [2019-12-18 12:27:03,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:27:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-18 12:27:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-18 12:27:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-18 12:27:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-18 12:27:03,925 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-18 12:27:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:03,925 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-18 12:27:03,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:27:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-18 12:27:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:27:03,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:03,941 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 12:27:03,942 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 12:27:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-18 12:27:03,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:03,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885560470] [2019-12-18 12:27:03,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:04,039 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 12:27:04,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885560470] [2019-12-18 12:27:04,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:04,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:27:04,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953343871] [2019-12-18 12:27:04,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:04,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:04,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:04,041 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-18 12:27:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:05,137 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-18 12:27:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:27:05,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:27:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:05,172 INFO L225 Difference]: With dead ends: 24798 [2019-12-18 12:27:05,172 INFO L226 Difference]: Without dead ends: 24798 [2019-12-18 12:27:05,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:27:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-18 12:27:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-18 12:27:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 12:27:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-18 12:27:05,465 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-18 12:27:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:05,465 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-18 12:27:05,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-18 12:27:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:27:05,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:05,488 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 12:27:05,488 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 12:27:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-18 12:27:05,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:05,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860122682] [2019-12-18 12:27:05,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:05,557 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 12:27:05,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860122682] [2019-12-18 12:27:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:05,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:05,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726937617] [2019-12-18 12:27:05,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:05,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:05,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:05,559 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-18 12:27:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:05,999 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-18 12:27:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:05,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:27:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:06,027 INFO L225 Difference]: With dead ends: 28297 [2019-12-18 12:27:06,027 INFO L226 Difference]: Without dead ends: 14210 [2019-12-18 12:27:06,027 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 12:27:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-18 12:27:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-18 12:27:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-18 12:27:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-18 12:27:06,242 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-18 12:27:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:06,242 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-18 12:27:06,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-18 12:27:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:27:06,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:06,260 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 12:27:06,260 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 12:27:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-18 12:27:06,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:06,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310435795] [2019-12-18 12:27:06,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:06,321 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 12:27:06,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310435795] [2019-12-18 12:27:06,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:06,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:27:06,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366101041] [2019-12-18 12:27:06,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:06,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:06,323 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-18 12:27:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:06,381 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-18 12:27:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:06,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:27:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:06,402 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 12:27:06,403 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 12:27:06,403 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 12:27:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 12:27:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-18 12:27:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-18 12:27:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-18 12:27:06,605 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-18 12:27:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:06,605 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-18 12:27:06,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-18 12:27:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:27:06,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:06,623 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 12:27:06,623 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 12:27:06,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-18 12:27:06,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:06,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176022549] [2019-12-18 12:27:06,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:06,683 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 12:27:06,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176022549] [2019-12-18 12:27:06,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:06,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:27:06,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769001304] [2019-12-18 12:27:06,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:27:06,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:06,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:27:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:27:06,686 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-18 12:27:06,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:06,779 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-18 12:27:06,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:27:06,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:27:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:06,803 INFO L225 Difference]: With dead ends: 13093 [2019-12-18 12:27:06,803 INFO L226 Difference]: Without dead ends: 11563 [2019-12-18 12:27:06,804 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 12:27:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-18 12:27:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-18 12:27:06,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-18 12:27:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-18 12:27:06,998 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-18 12:27:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-18 12:27:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:27:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-18 12:27:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:07,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:07,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:07,012 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 12:27:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:07,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-18 12:27:07,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:07,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440269996] [2019-12-18 12:27:07,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:07,054 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 12:27:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440269996] [2019-12-18 12:27:07,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:07,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:07,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448281724] [2019-12-18 12:27:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:07,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:07,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:07,056 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-18 12:27:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:07,140 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-18 12:27:07,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:07,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:27:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:07,162 INFO L225 Difference]: With dead ends: 17888 [2019-12-18 12:27:07,162 INFO L226 Difference]: Without dead ends: 17888 [2019-12-18 12:27:07,162 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 12:27:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-18 12:27:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-18 12:27:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-18 12:27:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-18 12:27:07,384 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-18 12:27:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:07,384 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-18 12:27:07,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-18 12:27:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:07,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:07,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:07,399 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 12:27:07,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:07,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-18 12:27:07,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:07,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61337606] [2019-12-18 12:27:07,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:07,542 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 12:27:07,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61337606] [2019-12-18 12:27:07,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:07,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:27:07,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249274398] [2019-12-18 12:27:07,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:07,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:07,548 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-18 12:27:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:08,038 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-18 12:27:08,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:27:08,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:27:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:08,097 INFO L225 Difference]: With dead ends: 37114 [2019-12-18 12:27:08,098 INFO L226 Difference]: Without dead ends: 27250 [2019-12-18 12:27:08,098 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 12:27:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-18 12:27:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-18 12:27:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-18 12:27:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-18 12:27:08,823 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-18 12:27:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:08,824 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-18 12:27:08,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-18 12:27:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:08,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:08,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:08,843 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 12:27:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-18 12:27:08,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:08,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277569846] [2019-12-18 12:27:08,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:08,937 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 12:27:08,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277569846] [2019-12-18 12:27:08,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:08,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:27:08,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745267664] [2019-12-18 12:27:08,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:08,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:08,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:08,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:08,940 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-18 12:27:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:09,562 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-18 12:27:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:27:09,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:27:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:09,625 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 12:27:09,626 INFO L226 Difference]: Without dead ends: 29917 [2019-12-18 12:27:09,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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 12:27:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-18 12:27:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-18 12:27:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-18 12:27:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-18 12:27:10,029 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-18 12:27:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:10,029 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-18 12:27:10,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:10,029 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-18 12:27:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:10,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:10,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:10,059 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 12:27:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:10,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-18 12:27:10,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:10,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622242218] [2019-12-18 12:27:10,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:10,197 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 12:27:10,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622242218] [2019-12-18 12:27:10,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:10,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:27:10,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563114927] [2019-12-18 12:27:10,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:27:10,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:27:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:27:10,199 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-18 12:27:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:11,684 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-18 12:27:11,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:27:11,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:27:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:11,795 INFO L225 Difference]: With dead ends: 69591 [2019-12-18 12:27:11,795 INFO L226 Difference]: Without dead ends: 65149 [2019-12-18 12:27:11,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:27:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-18 12:27:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-18 12:27:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-18 12:27:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-18 12:27:12,857 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-18 12:27:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:12,858 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-18 12:27:12,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:27:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-18 12:27:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:12,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:12,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:12,878 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 12:27:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:12,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-18 12:27:12,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:12,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757013121] [2019-12-18 12:27:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:12,918 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 12:27:12,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757013121] [2019-12-18 12:27:12,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:12,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:12,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539025658] [2019-12-18 12:27:12,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:12,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:12,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:12,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:12,920 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-18 12:27:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:13,036 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-18 12:27:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:13,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:27:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:13,067 INFO L225 Difference]: With dead ends: 23765 [2019-12-18 12:27:13,067 INFO L226 Difference]: Without dead ends: 23765 [2019-12-18 12:27:13,067 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 12:27:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-18 12:27:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-18 12:27:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-18 12:27:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-18 12:27:13,380 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-18 12:27:13,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:13,380 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-18 12:27:13,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-18 12:27:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:13,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:13,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:13,400 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 12:27:13,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-18 12:27:13,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:13,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362490853] [2019-12-18 12:27:13,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:27:13,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362490853] [2019-12-18 12:27:13,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:13,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:27:13,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243994232] [2019-12-18 12:27:13,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:27:13,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:13,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:27:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:27:13,511 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-18 12:27:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:14,785 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-18 12:27:14,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:27:14,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:27:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:14,868 INFO L225 Difference]: With dead ends: 63866 [2019-12-18 12:27:14,868 INFO L226 Difference]: Without dead ends: 61442 [2019-12-18 12:27:14,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:27:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-18 12:27:15,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-18 12:27:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-18 12:27:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-18 12:27:15,891 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-18 12:27:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:15,892 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-18 12:27:15,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:27:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-18 12:27:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:27:15,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:15,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:15,911 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 12:27:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:15,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-18 12:27:15,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:15,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200281106] [2019-12-18 12:27:15,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:15,981 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 12:27:15,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200281106] [2019-12-18 12:27:15,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:15,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:15,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816693242] [2019-12-18 12:27:15,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:15,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:15,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:15,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:15,983 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 3 states. [2019-12-18 12:27:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:16,107 INFO L93 Difference]: Finished difference Result 22647 states and 69341 transitions. [2019-12-18 12:27:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:16,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:27:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:16,140 INFO L225 Difference]: With dead ends: 22647 [2019-12-18 12:27:16,140 INFO L226 Difference]: Without dead ends: 22647 [2019-12-18 12:27:16,140 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 12:27:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22647 states. [2019-12-18 12:27:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22647 to 19666. [2019-12-18 12:27:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19666 states. [2019-12-18 12:27:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19666 states to 19666 states and 60576 transitions. [2019-12-18 12:27:16,454 INFO L78 Accepts]: Start accepts. Automaton has 19666 states and 60576 transitions. Word has length 64 [2019-12-18 12:27:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:16,454 INFO L462 AbstractCegarLoop]: Abstraction has 19666 states and 60576 transitions. [2019-12-18 12:27:16,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 19666 states and 60576 transitions. [2019-12-18 12:27:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:27:16,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:16,476 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 12:27:16,477 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 12:27:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1362059626, now seen corresponding path program 1 times [2019-12-18 12:27:16,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:16,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880762682] [2019-12-18 12:27:16,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:16,595 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 12:27:16,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880762682] [2019-12-18 12:27:16,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:16,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:27:16,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875421964] [2019-12-18 12:27:16,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:27:16,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:27:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:27:16,598 INFO L87 Difference]: Start difference. First operand 19666 states and 60576 transitions. Second operand 9 states. [2019-12-18 12:27:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:17,835 INFO L93 Difference]: Finished difference Result 55818 states and 167465 transitions. [2019-12-18 12:27:17,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:27:17,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:27:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:17,907 INFO L225 Difference]: With dead ends: 55818 [2019-12-18 12:27:17,907 INFO L226 Difference]: Without dead ends: 52885 [2019-12-18 12:27:17,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:27:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52885 states. [2019-12-18 12:27:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52885 to 19731. [2019-12-18 12:27:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19731 states. [2019-12-18 12:27:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19731 states to 19731 states and 60809 transitions. [2019-12-18 12:27:18,447 INFO L78 Accepts]: Start accepts. Automaton has 19731 states and 60809 transitions. Word has length 65 [2019-12-18 12:27:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:18,447 INFO L462 AbstractCegarLoop]: Abstraction has 19731 states and 60809 transitions. [2019-12-18 12:27:18,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:27:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 19731 states and 60809 transitions. [2019-12-18 12:27:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:27:18,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:18,467 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 12:27:18,467 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 12:27:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash 938389066, now seen corresponding path program 2 times [2019-12-18 12:27:18,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:18,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267700201] [2019-12-18 12:27:18,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:27:18,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267700201] [2019-12-18 12:27:18,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:18,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:27:18,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380868636] [2019-12-18 12:27:18,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:27:18,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:27:18,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:27:18,591 INFO L87 Difference]: Start difference. First operand 19731 states and 60809 transitions. Second operand 9 states. [2019-12-18 12:27:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:20,239 INFO L93 Difference]: Finished difference Result 60486 states and 181076 transitions. [2019-12-18 12:27:20,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:27:20,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:27:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:20,316 INFO L225 Difference]: With dead ends: 60486 [2019-12-18 12:27:20,316 INFO L226 Difference]: Without dead ends: 57568 [2019-12-18 12:27:20,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:27:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57568 states. [2019-12-18 12:27:20,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57568 to 19623. [2019-12-18 12:27:20,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19623 states. [2019-12-18 12:27:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19623 states to 19623 states and 60279 transitions. [2019-12-18 12:27:20,880 INFO L78 Accepts]: Start accepts. Automaton has 19623 states and 60279 transitions. Word has length 65 [2019-12-18 12:27:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:20,880 INFO L462 AbstractCegarLoop]: Abstraction has 19623 states and 60279 transitions. [2019-12-18 12:27:20,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:27:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19623 states and 60279 transitions. [2019-12-18 12:27:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:27:20,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:20,903 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 12:27:20,903 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 12:27:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-18 12:27:20,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:20,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645525972] [2019-12-18 12:27:20,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:20,978 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 12:27:20,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645525972] [2019-12-18 12:27:20,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:20,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:20,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878555159] [2019-12-18 12:27:20,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:20,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:20,980 INFO L87 Difference]: Start difference. First operand 19623 states and 60279 transitions. Second operand 3 states. [2019-12-18 12:27:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:21,047 INFO L93 Difference]: Finished difference Result 16417 states and 49438 transitions. [2019-12-18 12:27:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:21,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:27:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:21,067 INFO L225 Difference]: With dead ends: 16417 [2019-12-18 12:27:21,068 INFO L226 Difference]: Without dead ends: 16417 [2019-12-18 12:27:21,068 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 12:27:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16417 states. [2019-12-18 12:27:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16417 to 15430. [2019-12-18 12:27:21,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15430 states. [2019-12-18 12:27:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15430 states to 15430 states and 46363 transitions. [2019-12-18 12:27:21,289 INFO L78 Accepts]: Start accepts. Automaton has 15430 states and 46363 transitions. Word has length 65 [2019-12-18 12:27:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:21,289 INFO L462 AbstractCegarLoop]: Abstraction has 15430 states and 46363 transitions. [2019-12-18 12:27:21,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 15430 states and 46363 transitions. [2019-12-18 12:27:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:21,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:21,304 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 12:27:21,305 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 12:27:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash 451194278, now seen corresponding path program 1 times [2019-12-18 12:27:21,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:21,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684162407] [2019-12-18 12:27:21,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:21,468 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 12:27:21,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684162407] [2019-12-18 12:27:21,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:21,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:27:21,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582080978] [2019-12-18 12:27:21,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:27:21,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:27:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:27:21,470 INFO L87 Difference]: Start difference. First operand 15430 states and 46363 transitions. Second operand 10 states. [2019-12-18 12:27:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:23,241 INFO L93 Difference]: Finished difference Result 28551 states and 85513 transitions. [2019-12-18 12:27:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:27:23,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:27:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:23,270 INFO L225 Difference]: With dead ends: 28551 [2019-12-18 12:27:23,270 INFO L226 Difference]: Without dead ends: 21480 [2019-12-18 12:27:23,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:27:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21480 states. [2019-12-18 12:27:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21480 to 15928. [2019-12-18 12:27:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15928 states. [2019-12-18 12:27:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15928 states to 15928 states and 47733 transitions. [2019-12-18 12:27:23,927 INFO L78 Accepts]: Start accepts. Automaton has 15928 states and 47733 transitions. Word has length 66 [2019-12-18 12:27:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:23,927 INFO L462 AbstractCegarLoop]: Abstraction has 15928 states and 47733 transitions. [2019-12-18 12:27:23,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:27:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15928 states and 47733 transitions. [2019-12-18 12:27:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:23,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:23,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:23,943 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 12:27:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1214023746, now seen corresponding path program 2 times [2019-12-18 12:27:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:23,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340283738] [2019-12-18 12:27:23,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:24,115 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 12:27:24,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340283738] [2019-12-18 12:27:24,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:24,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:27:24,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480626173] [2019-12-18 12:27:24,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:27:24,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:27:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:27:24,118 INFO L87 Difference]: Start difference. First operand 15928 states and 47733 transitions. Second operand 11 states. [2019-12-18 12:27:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:25,811 INFO L93 Difference]: Finished difference Result 27399 states and 81497 transitions. [2019-12-18 12:27:25,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:27:25,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:27:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:25,841 INFO L225 Difference]: With dead ends: 27399 [2019-12-18 12:27:25,841 INFO L226 Difference]: Without dead ends: 22124 [2019-12-18 12:27:25,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:27:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22124 states. [2019-12-18 12:27:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22124 to 15952. [2019-12-18 12:27:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15952 states. [2019-12-18 12:27:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15952 states to 15952 states and 47651 transitions. [2019-12-18 12:27:26,119 INFO L78 Accepts]: Start accepts. Automaton has 15952 states and 47651 transitions. Word has length 66 [2019-12-18 12:27:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:26,119 INFO L462 AbstractCegarLoop]: Abstraction has 15952 states and 47651 transitions. [2019-12-18 12:27:26,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:27:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15952 states and 47651 transitions. [2019-12-18 12:27:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:26,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:26,138 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 12:27:26,138 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 12:27:26,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:26,138 INFO L82 PathProgramCache]: Analyzing trace with hash 60784614, now seen corresponding path program 3 times [2019-12-18 12:27:26,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280735276] [2019-12-18 12:27:26,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:26,341 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 12:27:26,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280735276] [2019-12-18 12:27:26,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:26,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:27:26,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608418038] [2019-12-18 12:27:26,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:27:26,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:27:26,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:27:26,343 INFO L87 Difference]: Start difference. First operand 15952 states and 47651 transitions. Second operand 11 states. [2019-12-18 12:27:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:27,475 INFO L93 Difference]: Finished difference Result 35374 states and 105587 transitions. [2019-12-18 12:27:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:27:27,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:27:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:27,519 INFO L225 Difference]: With dead ends: 35374 [2019-12-18 12:27:27,519 INFO L226 Difference]: Without dead ends: 31793 [2019-12-18 12:27:27,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:27:27,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31793 states. [2019-12-18 12:27:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31793 to 18508. [2019-12-18 12:27:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-12-18 12:27:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 54966 transitions. [2019-12-18 12:27:27,882 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 54966 transitions. Word has length 66 [2019-12-18 12:27:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:27,883 INFO L462 AbstractCegarLoop]: Abstraction has 18508 states and 54966 transitions. [2019-12-18 12:27:27,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:27:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 54966 transitions. [2019-12-18 12:27:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:27,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:27,902 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 12:27:27,902 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 12:27:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash 741333008, now seen corresponding path program 4 times [2019-12-18 12:27:27,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:27,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452679089] [2019-12-18 12:27:27,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:28,064 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 12:27:28,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452679089] [2019-12-18 12:27:28,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:28,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:27:28,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175152408] [2019-12-18 12:27:28,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:27:28,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:28,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:27:28,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:27:28,066 INFO L87 Difference]: Start difference. First operand 18508 states and 54966 transitions. Second operand 11 states. [2019-12-18 12:27:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:29,112 INFO L93 Difference]: Finished difference Result 32563 states and 96305 transitions. [2019-12-18 12:27:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:27:29,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:27:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:29,147 INFO L225 Difference]: With dead ends: 32563 [2019-12-18 12:27:29,147 INFO L226 Difference]: Without dead ends: 27036 [2019-12-18 12:27:29,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:27:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27036 states. [2019-12-18 12:27:29,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27036 to 14966. [2019-12-18 12:27:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14966 states. [2019-12-18 12:27:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14966 states to 14966 states and 44631 transitions. [2019-12-18 12:27:29,799 INFO L78 Accepts]: Start accepts. Automaton has 14966 states and 44631 transitions. Word has length 66 [2019-12-18 12:27:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:29,800 INFO L462 AbstractCegarLoop]: Abstraction has 14966 states and 44631 transitions. [2019-12-18 12:27:29,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:27:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 14966 states and 44631 transitions. [2019-12-18 12:27:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:29,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:29,815 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 12:27:29,815 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 12:27:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:29,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1609612826, now seen corresponding path program 5 times [2019-12-18 12:27:29,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:29,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204682613] [2019-12-18 12:27:29,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:29,996 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 12:27:29,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204682613] [2019-12-18 12:27:29,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:29,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:27:29,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372431637] [2019-12-18 12:27:29,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:27:29,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:27:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:27:29,999 INFO L87 Difference]: Start difference. First operand 14966 states and 44631 transitions. Second operand 12 states. [2019-12-18 12:27:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:30,969 INFO L93 Difference]: Finished difference Result 27027 states and 80445 transitions. [2019-12-18 12:27:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:27:30,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:27:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:31,003 INFO L225 Difference]: With dead ends: 27027 [2019-12-18 12:27:31,004 INFO L226 Difference]: Without dead ends: 26799 [2019-12-18 12:27:31,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:27:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26799 states. [2019-12-18 12:27:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26799 to 14790. [2019-12-18 12:27:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14790 states. [2019-12-18 12:27:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14790 states to 14790 states and 44147 transitions. [2019-12-18 12:27:31,295 INFO L78 Accepts]: Start accepts. Automaton has 14790 states and 44147 transitions. Word has length 66 [2019-12-18 12:27:31,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:31,295 INFO L462 AbstractCegarLoop]: Abstraction has 14790 states and 44147 transitions. [2019-12-18 12:27:31,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:27:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 14790 states and 44147 transitions. [2019-12-18 12:27:31,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:27:31,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:31,310 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 12:27:31,310 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 12:27:31,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1227939376, now seen corresponding path program 6 times [2019-12-18 12:27:31,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:31,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612234537] [2019-12-18 12:27:31,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:31,373 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 12:27:31,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612234537] [2019-12-18 12:27:31,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:31,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:31,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486478157] [2019-12-18 12:27:31,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:31,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:31,375 INFO L87 Difference]: Start difference. First operand 14790 states and 44147 transitions. Second operand 3 states. [2019-12-18 12:27:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:31,434 INFO L93 Difference]: Finished difference Result 14789 states and 44145 transitions. [2019-12-18 12:27:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:31,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:27:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:31,458 INFO L225 Difference]: With dead ends: 14789 [2019-12-18 12:27:31,458 INFO L226 Difference]: Without dead ends: 14789 [2019-12-18 12:27:31,459 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 12:27:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14789 states. [2019-12-18 12:27:31,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14789 to 11818. [2019-12-18 12:27:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11818 states. [2019-12-18 12:27:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11818 states to 11818 states and 35760 transitions. [2019-12-18 12:27:31,657 INFO L78 Accepts]: Start accepts. Automaton has 11818 states and 35760 transitions. Word has length 66 [2019-12-18 12:27:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:31,658 INFO L462 AbstractCegarLoop]: Abstraction has 11818 states and 35760 transitions. [2019-12-18 12:27:31,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 11818 states and 35760 transitions. [2019-12-18 12:27:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:27:31,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:31,669 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 12:27:31,669 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 12:27:31,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 1 times [2019-12-18 12:27:31,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:31,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927043488] [2019-12-18 12:27:31,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:31,846 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:27:31,846 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:27:31,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37|) 0) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t293~0.base_37| 4)) (= v_~main$tmp_guard1~0_42 0) (= v_~a$r_buff0_thd3~0_430 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t293~0.base_37|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t293~0.base_37|) |v_ULTIMATE.start_main_~#t293~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t293~0.base_37| 1)) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= |v_ULTIMATE.start_main_~#t293~0.offset_26| 0) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_~#t293~0.offset=|v_ULTIMATE.start_main_~#t293~0.offset_26|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_38|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_26|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t293~0.base=|v_ULTIMATE.start_main_~#t293~0.base_37|} AuxVars[] AssignedVars[~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_~#t293~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t294~0.base, #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, ULTIMATE.start_main_~#t295~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t295~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t294~0.offset, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~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, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t293~0.base] because there is no mapped edge [2019-12-18 12:27:31,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13|) 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t294~0.base_13| 1) |v_#valid_40|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t294~0.base_13|) |v_ULTIMATE.start_main_~#t294~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t294~0.base_13|)) (= |v_ULTIMATE.start_main_~#t294~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t294~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t294~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t294~0.offset=|v_ULTIMATE.start_main_~#t294~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t294~0.base=|v_ULTIMATE.start_main_~#t294~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t294~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t294~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:27:31,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:27:31,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-560038832 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd2~0_In-560038832 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-560038832| ~a~0_In-560038832)) (and (= ~a$w_buff1~0_In-560038832 |P1Thread1of1ForFork2_#t~ite9_Out-560038832|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-560038832, ~a$w_buff1~0=~a$w_buff1~0_In-560038832, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-560038832, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-560038832} OutVars{~a~0=~a~0_In-560038832, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-560038832|, ~a$w_buff1~0=~a$w_buff1~0_In-560038832, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-560038832, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-560038832} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:27:31,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:27:31,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In2077753315 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2077753315 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In2077753315 |P0Thread1of1ForFork1_#t~ite5_Out2077753315|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out2077753315| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2077753315, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2077753315} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2077753315|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2077753315, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2077753315} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:27:31,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In345968659 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In345968659 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In345968659 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In345968659 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In345968659 |P0Thread1of1ForFork1_#t~ite6_Out345968659|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out345968659|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In345968659, ~a$w_buff0_used~0=~a$w_buff0_used~0_In345968659, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In345968659, ~a$w_buff1_used~0=~a$w_buff1_used~0_In345968659} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out345968659|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In345968659, ~a$w_buff0_used~0=~a$w_buff0_used~0_In345968659, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In345968659, ~a$w_buff1_used~0=~a$w_buff1_used~0_In345968659} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:27:31,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1163546909 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1163546909 256) 0))) (or (and (not .cse0) (= ~a$r_buff0_thd1~0_Out1163546909 0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out1163546909 ~a$r_buff0_thd1~0_In1163546909)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1163546909, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1163546909} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1163546909|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1163546909, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1163546909} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:27:31,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In638265813 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In638265813 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In638265813 256))) (.cse3 (= (mod ~a$r_buff0_thd1~0_In638265813 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out638265813| ~a$r_buff1_thd1~0_In638265813)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out638265813| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In638265813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In638265813, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In638265813, ~a$w_buff1_used~0=~a$w_buff1_used~0_In638265813} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out638265813|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In638265813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In638265813, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In638265813, ~a$w_buff1_used~0=~a$w_buff1_used~0_In638265813} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:27:31,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} 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 12:27:31,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t295~0.base_12| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t295~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12|)) (= |v_ULTIMATE.start_main_~#t295~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t295~0.base_12| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t295~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t295~0.base_12|) |v_ULTIMATE.start_main_~#t295~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t295~0.offset=|v_ULTIMATE.start_main_~#t295~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t295~0.base=|v_ULTIMATE.start_main_~#t295~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t295~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t295~0.base] because there is no mapped edge [2019-12-18 12:27:31,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In694193363 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In694193363| |P2Thread1of1ForFork0_#t~ite20_Out694193363|) (= |P2Thread1of1ForFork0_#t~ite21_Out694193363| ~a$w_buff0~0_In694193363)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out694193363| |P2Thread1of1ForFork0_#t~ite20_Out694193363|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In694193363 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In694193363 256))) (and (= (mod ~a$w_buff1_used~0_In694193363 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In694193363 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out694193363| ~a$w_buff0~0_In694193363)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In694193363, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In694193363, ~a$w_buff0_used~0=~a$w_buff0_used~0_In694193363, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In694193363, ~a$w_buff1_used~0=~a$w_buff1_used~0_In694193363, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In694193363|, ~weak$$choice2~0=~weak$$choice2~0_In694193363} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out694193363|, ~a$w_buff0~0=~a$w_buff0~0_In694193363, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In694193363, ~a$w_buff0_used~0=~a$w_buff0_used~0_In694193363, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In694193363, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out694193363|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In694193363, ~weak$$choice2~0=~weak$$choice2~0_In694193363} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:27:31,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1028657814 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In1028657814| |P2Thread1of1ForFork0_#t~ite26_Out1028657814|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1028657814| ~a$w_buff0_used~0_In1028657814)) (and (= ~a$w_buff0_used~0_In1028657814 |P2Thread1of1ForFork0_#t~ite26_Out1028657814|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1028657814 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1028657814 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In1028657814 256) 0)) (= (mod ~a$w_buff0_used~0_In1028657814 256) 0))) .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out1028657814| |P2Thread1of1ForFork0_#t~ite26_Out1028657814|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1028657814|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1028657814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1028657814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1028657814, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1028657814, ~weak$$choice2~0=~weak$$choice2~0_In1028657814} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1028657814|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1028657814|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1028657814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1028657814, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1028657814, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1028657814, ~weak$$choice2~0=~weak$$choice2~0_In1028657814} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:27:31,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In983380373 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In983380373 256)))) (or (and .cse0 (= (mod ~a$w_buff1_used~0_In983380373 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In983380373 256)) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In983380373 256))))) (= |P2Thread1of1ForFork0_#t~ite29_Out983380373| |P2Thread1of1ForFork0_#t~ite30_Out983380373|) (= |P2Thread1of1ForFork0_#t~ite29_Out983380373| ~a$w_buff1_used~0_In983380373) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In983380373| |P2Thread1of1ForFork0_#t~ite29_Out983380373|) (= ~a$w_buff1_used~0_In983380373 |P2Thread1of1ForFork0_#t~ite30_Out983380373|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In983380373, ~a$w_buff0_used~0=~a$w_buff0_used~0_In983380373, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In983380373, ~a$w_buff1_used~0=~a$w_buff1_used~0_In983380373, ~weak$$choice2~0=~weak$$choice2~0_In983380373, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In983380373|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In983380373, ~a$w_buff0_used~0=~a$w_buff0_used~0_In983380373, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In983380373, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out983380373|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In983380373, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out983380373|, ~weak$$choice2~0=~weak$$choice2~0_In983380373} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:27:31,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} 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 12:27:31,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:27:31,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1732506978 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1732506978 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1732506978| ~a~0_In1732506978) (or .cse0 .cse1)) (and (= ~a$w_buff1~0_In1732506978 |P2Thread1of1ForFork0_#t~ite38_Out1732506978|) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In1732506978, ~a$w_buff1~0=~a$w_buff1~0_In1732506978, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1732506978, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1732506978} OutVars{~a~0=~a~0_In1732506978, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1732506978|, ~a$w_buff1~0=~a$w_buff1~0_In1732506978, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1732506978, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1732506978} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:27:31,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:27:31,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1026894998 256))) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1026894998 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1026894998| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-1026894998| ~a$w_buff0_used~0_In-1026894998)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1026894998, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1026894998} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1026894998|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1026894998, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1026894998} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:27:31,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In1313849631 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd3~0_In1313849631 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1313849631 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1313849631 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1313849631| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out1313849631| ~a$w_buff1_used~0_In1313849631) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1313849631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1313849631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1313849631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1313849631} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1313849631, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1313849631, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1313849631, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1313849631, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1313849631|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:27:31,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1546031327 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1546031327 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1546031327| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1546031327| ~a$r_buff0_thd3~0_In1546031327)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1546031327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1546031327} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1546031327, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1546031327, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1546031327|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:27:31,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1416305987 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1416305987 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In-1416305987 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1416305987 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1416305987|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd3~0_In-1416305987 |P2Thread1of1ForFork0_#t~ite43_Out-1416305987|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1416305987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1416305987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1416305987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1416305987} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1416305987|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1416305987, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1416305987, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1416305987, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1416305987} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:27:31,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, 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 12:27:31,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In219722611 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In219722611 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out219722611| 0)) (and (= ~a$w_buff0_used~0_In219722611 |P1Thread1of1ForFork2_#t~ite11_Out219722611|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In219722611, ~a$w_buff0_used~0=~a$w_buff0_used~0_In219722611} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In219722611, ~a$w_buff0_used~0=~a$w_buff0_used~0_In219722611, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out219722611|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:27:31,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In632902507 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In632902507 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In632902507 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In632902507 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out632902507|)) (and (= ~a$w_buff1_used~0_In632902507 |P1Thread1of1ForFork2_#t~ite12_Out632902507|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In632902507, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In632902507, ~a$w_buff0_used~0=~a$w_buff0_used~0_In632902507, ~a$w_buff1_used~0=~a$w_buff1_used~0_In632902507} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In632902507, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In632902507, ~a$w_buff0_used~0=~a$w_buff0_used~0_In632902507, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out632902507|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In632902507} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:27:31,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-651141990 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-651141990 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-651141990| 0)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-651141990| ~a$r_buff0_thd2~0_In-651141990) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-651141990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-651141990} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-651141990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-651141990, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-651141990|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:27:31,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In906425828 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In906425828 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In906425828 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In906425828 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out906425828| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite14_Out906425828| ~a$r_buff1_thd2~0_In906425828)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In906425828, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In906425828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In906425828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In906425828} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In906425828, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In906425828, ~a$w_buff0_used~0=~a$w_buff0_used~0_In906425828, ~a$w_buff1_used~0=~a$w_buff1_used~0_In906425828, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out906425828|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:27:31,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, 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 12:27:31,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:27:31,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In929551231 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In929551231 256) 0))) (or (and (= ~a~0_In929551231 |ULTIMATE.start_main_#t~ite47_Out929551231|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out929551231| ~a$w_buff1~0_In929551231) (not .cse1)))) InVars {~a~0=~a~0_In929551231, ~a$w_buff1~0=~a$w_buff1~0_In929551231, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In929551231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In929551231} OutVars{~a~0=~a~0_In929551231, ~a$w_buff1~0=~a$w_buff1~0_In929551231, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out929551231|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In929551231, ~a$w_buff1_used~0=~a$w_buff1_used~0_In929551231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:27:31,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:27:31,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In414910441 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In414910441 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out414910441| ~a$w_buff0_used~0_In414910441) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out414910441| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In414910441, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In414910441} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In414910441, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out414910441|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In414910441} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:27:31,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In339973772 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In339973772 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In339973772 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In339973772 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out339973772|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In339973772 |ULTIMATE.start_main_#t~ite50_Out339973772|) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In339973772, ~a$w_buff0_used~0=~a$w_buff0_used~0_In339973772, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In339973772, ~a$w_buff1_used~0=~a$w_buff1_used~0_In339973772} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out339973772|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In339973772, ~a$w_buff0_used~0=~a$w_buff0_used~0_In339973772, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In339973772, ~a$w_buff1_used~0=~a$w_buff1_used~0_In339973772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:27:31,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In764207991 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In764207991 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out764207991| ~a$r_buff0_thd0~0_In764207991) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out764207991| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In764207991, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In764207991} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out764207991|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In764207991, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In764207991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:27:31,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~a$w_buff0_used~0_In-1509568253 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-1509568253 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1509568253 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-1509568253 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-1509568253| ~a$r_buff1_thd0~0_In-1509568253) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1509568253| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1509568253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1509568253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1509568253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1509568253} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1509568253|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1509568253, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1509568253, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1509568253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1509568253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:27:31,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} 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 12:27:32,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:27:32 BasicIcfg [2019-12-18 12:27:32,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:27:32,008 INFO L168 Benchmark]: Toolchain (without parser) took 107597.52 ms. Allocated memory was 146.8 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 102.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,008 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.77 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 157.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.18 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 155.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,010 INFO L168 Benchmark]: Boogie Preprocessor took 73.63 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,010 INFO L168 Benchmark]: RCFGBuilder took 1050.70 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,012 INFO L168 Benchmark]: TraceAbstraction took 105607.17 ms. Allocated memory was 204.5 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-18 12:27:32,021 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.77 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.1 MB in the beginning and 157.6 MB in the end (delta: -55.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.18 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 155.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.63 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1050.70 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105607.17 ms. Allocated memory was 204.5 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t293, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L837] FCALL, FORK 0 pthread_create(&t294, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] 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_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=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 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_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 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) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 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 [L839] FCALL, FORK 0 pthread_create(&t295, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __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=0, 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=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __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_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=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 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=1, __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_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=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 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) [L801] 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)) [L802] 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_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_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=7, 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=2, y=1, z=1] [L802] 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)) [L803] 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)) [L804] 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)) [L806] 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_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_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=7, 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=2, y=1, z=1] [L806] 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)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __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_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=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 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_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_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=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 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 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 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 [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 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_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_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=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 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 [L848] 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, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 23.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7197 SDtfs, 9977 SDslu, 27035 SDs, 0 SdLazy, 10858 SolverSat, 408 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 303 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred 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: 51.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 305960 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1374 NumberOfCodeBlocks, 1374 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1280 ConstructedInterpolants, 0 QuantifiedInterpolants, 233812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...