/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:51:22,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:51:22,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:51:22,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:51:22,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:51:22,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:51:22,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:51:22,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:51:22,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:51:22,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:51:22,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:51:22,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:51:22,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:51:22,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:51:22,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:51:22,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:51:22,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:51:22,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:51:22,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:51:22,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:51:22,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:51:22,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:51:22,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:51:22,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:51:22,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:51:22,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:51:22,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:51:22,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:51:22,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:51:22,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:51:22,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:51:22,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:51:22,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:51:22,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:51:22,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:51:22,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:51:22,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:51:22,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:51:22,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:51:22,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:51:22,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:51:22,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:51:22,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:51:22,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:51:22,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:51:22,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:51:22,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:51:22,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:51:22,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:51:22,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:51:22,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:51:22,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:51:22,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:51:22,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:51:22,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:51:22,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:51:22,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:51:22,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:51:22,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:51:22,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:51:22,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:51:22,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:51:22,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:51:22,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:51:22,158 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:51:22,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:51:22,158 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:51:22,423 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:51:22,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:51:22,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:51:22,446 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:51:22,446 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:51:22,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 07:51:22,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555d7e0cd/1688204bfaa046aea128a6823995f5f2/FLAGb1dc229aa [2019-12-27 07:51:23,118 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:51:23,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_pso.oepc.i [2019-12-27 07:51:23,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555d7e0cd/1688204bfaa046aea128a6823995f5f2/FLAGb1dc229aa [2019-12-27 07:51:23,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/555d7e0cd/1688204bfaa046aea128a6823995f5f2 [2019-12-27 07:51:23,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:51:23,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:51:23,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:23,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:51:23,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:51:23,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:23" (1/1) ... [2019-12-27 07:51:23,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eab83d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:23, skipping insertion in model container [2019-12-27 07:51:23,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:51:23" (1/1) ... [2019-12-27 07:51:23,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:51:23,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:51:24,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:24,047 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:51:24,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:51:24,201 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:51:24,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24 WrapperNode [2019-12-27 07:51:24,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:51:24,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:24,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:51:24,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:51:24,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:51:24,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:51:24,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:51:24,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:51:24,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (1/1) ... [2019-12-27 07:51:24,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:51:24,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:51:24,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:51:24,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:51:24,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (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-27 07:51:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:51:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:51:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:51:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:51:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:51:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:51:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:51:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:51:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:51:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:51:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:51:24,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:51:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:51:24,395 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:51:25,208 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:51:25,209 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:51:25,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:25 BoogieIcfgContainer [2019-12-27 07:51:25,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:51:25,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:51:25,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:51:25,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:51:25,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:51:23" (1/3) ... [2019-12-27 07:51:25,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:25, skipping insertion in model container [2019-12-27 07:51:25,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:51:24" (2/3) ... [2019-12-27 07:51:25,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:51:25, skipping insertion in model container [2019-12-27 07:51:25,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:51:25" (3/3) ... [2019-12-27 07:51:25,222 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_pso.oepc.i [2019-12-27 07:51:25,233 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:51:25,234 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:51:25,244 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:51:25,245 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:51:25,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,308 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,309 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,310 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,339 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,413 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:51:25,435 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:51:25,455 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:51:25,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:51:25,456 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:51:25,457 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:51:25,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:51:25,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:51:25,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:51:25,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:51:25,476 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 07:51:25,478 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:25,584 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:25,584 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:25,601 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:25,623 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 07:51:25,678 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 07:51:25,678 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:51:25,686 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:51:25,708 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 07:51:25,709 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:51:29,398 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:51:29,535 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:51:29,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 07:51:29,554 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 07:51:29,557 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 07:51:45,617 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 07:51:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 07:51:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:51:45,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:51:45,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:51:45,627 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-27 07:51:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:51:45,632 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 07:51:45,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:51:45,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362651449] [2019-12-27 07:51:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:51:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:51:45,849 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-27 07:51:45,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362651449] [2019-12-27 07:51:45,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:51:45,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:51:45,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793151459] [2019-12-27 07:51:45,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:51:45,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:51:45,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:51:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:51:45,878 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 07:51:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:51:49,619 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 07:51:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:51:49,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:51:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:51:50,403 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 07:51:50,403 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 07:51:50,413 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-27 07:51:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 07:51:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 07:51:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 07:52:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 07:52:00,200 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 07:52:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:00,200 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 07:52:00,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 07:52:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:52:00,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:00,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:00,205 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-27 07:52:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 07:52:00,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:00,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448378545] [2019-12-27 07:52:00,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:00,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-27 07:52:00,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448378545] [2019-12-27 07:52:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:00,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641564139] [2019-12-27 07:52:00,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:00,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:00,346 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 07:52:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:05,137 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 07:52:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:05,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:52:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:05,728 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 07:52:05,728 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 07:52:05,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 07:52:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 07:52:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 07:52:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 07:52:14,759 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 07:52:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:14,759 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 07:52:14,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 07:52:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:52:14,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:14,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:14,767 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-27 07:52:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 07:52:14,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869250896] [2019-12-27 07:52:14,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:14,832 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-27 07:52:14,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869250896] [2019-12-27 07:52:14,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:14,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:14,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493234121] [2019-12-27 07:52:14,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:14,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:14,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:14,834 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 07:52:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:19,437 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 07:52:19,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:19,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:52:19,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:19,502 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 07:52:19,503 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 07:52:19,503 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-27 07:52:19,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 07:52:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 07:52:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 07:52:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 07:52:20,263 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 07:52:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 07:52:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 07:52:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:52:20,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:20,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:20,267 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-27 07:52:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 07:52:20,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:20,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094989870] [2019-12-27 07:52:20,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:20,421 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-27 07:52:20,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094989870] [2019-12-27 07:52:20,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:20,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:20,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260468919] [2019-12-27 07:52:20,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:20,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:20,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:20,423 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 07:52:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:20,967 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 07:52:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:20,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 07:52:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:21,047 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 07:52:21,048 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 07:52:21,048 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-27 07:52:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 07:52:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 07:52:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 07:52:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 07:52:22,042 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 07:52:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:22,043 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 07:52:22,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 07:52:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:52:22,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:22,052 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-27 07:52:22,052 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-27 07:52:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 07:52:22,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:22,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208852603] [2019-12-27 07:52:22,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:22,217 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-27 07:52:22,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208852603] [2019-12-27 07:52:22,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:22,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:22,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165945215] [2019-12-27 07:52:22,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:22,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:22,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:22,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:22,221 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 07:52:23,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:23,240 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 07:52:23,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:23,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 07:52:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:23,328 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 07:52:23,328 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 07:52:23,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:52:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 07:52:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 07:52:24,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 07:52:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 07:52:24,368 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 07:52:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:24,369 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 07:52:24,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 07:52:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:52:24,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:24,383 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-27 07:52:24,383 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-27 07:52:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 07:52:24,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:24,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021560536] [2019-12-27 07:52:24,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:24,434 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-27 07:52:24,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021560536] [2019-12-27 07:52:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:24,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:24,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073068236] [2019-12-27 07:52:24,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:24,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:24,436 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 4 states. [2019-12-27 07:52:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:24,506 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 07:52:24,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:24,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:52:24,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:24,527 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 07:52:24,527 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 07:52:24,527 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-27 07:52:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 07:52:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 07:52:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 07:52:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 07:52:24,752 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 07:52:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:24,752 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 07:52:24,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 07:52:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:52:24,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:24,763 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-27 07:52:24,763 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-27 07:52:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 07:52:24,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:24,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481964508] [2019-12-27 07:52:24,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:24,865 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-27 07:52:24,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481964508] [2019-12-27 07:52:24,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:24,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:24,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987520764] [2019-12-27 07:52:24,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:52:24,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:52:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:24,867 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 07:52:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:25,463 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 07:52:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:52:25,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 07:52:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:25,498 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 07:52:25,499 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 07:52:25,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:52:25,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 07:52:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 07:52:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 07:52:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 07:52:26,056 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 07:52:26,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:26,056 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 07:52:26,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:52:26,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 07:52:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:52:26,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:26,086 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-27 07:52:26,086 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-27 07:52:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 07:52:26,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:26,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801068070] [2019-12-27 07:52:26,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:26,255 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-27 07:52:26,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801068070] [2019-12-27 07:52:26,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:26,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:26,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340078712] [2019-12-27 07:52:26,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:26,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:26,258 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 07:52:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:27,528 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 07:52:27,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 07:52:27,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 07:52:27,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:27,564 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 07:52:27,564 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 07:52:27,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:52:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 07:52:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 07:52:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 07:52:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 07:52:27,869 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 07:52:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:27,869 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 07:52:27,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 07:52:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:52:27,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:27,892 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-27 07:52:27,892 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-27 07:52:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 07:52:27,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:27,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071875670] [2019-12-27 07:52:27,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:27,950 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-27 07:52:27,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071875670] [2019-12-27 07:52:27,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:27,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:52:27,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486155130] [2019-12-27 07:52:27,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:27,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:27,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:27,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:27,953 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 3 states. [2019-12-27 07:52:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:28,024 INFO L93 Difference]: Finished difference Result 16953 states and 50980 transitions. [2019-12-27 07:52:28,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:28,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:52:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:28,055 INFO L225 Difference]: With dead ends: 16953 [2019-12-27 07:52:28,056 INFO L226 Difference]: Without dead ends: 16953 [2019-12-27 07:52:28,056 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-27 07:52:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2019-12-27 07:52:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16953. [2019-12-27 07:52:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16953 states. [2019-12-27 07:52:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16953 states to 16953 states and 50980 transitions. [2019-12-27 07:52:28,492 INFO L78 Accepts]: Start accepts. Automaton has 16953 states and 50980 transitions. Word has length 39 [2019-12-27 07:52:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:28,493 INFO L462 AbstractCegarLoop]: Abstraction has 16953 states and 50980 transitions. [2019-12-27 07:52:28,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16953 states and 50980 transitions. [2019-12-27 07:52:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:28,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:28,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:52:28,526 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-27 07:52:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1842516343, now seen corresponding path program 1 times [2019-12-27 07:52:28,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:28,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027725526] [2019-12-27 07:52:28,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:28,618 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-27 07:52:28,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027725526] [2019-12-27 07:52:28,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:28,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:28,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908484050] [2019-12-27 07:52:28,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:28,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:28,621 INFO L87 Difference]: Start difference. First operand 16953 states and 50980 transitions. Second operand 4 states. [2019-12-27 07:52:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:28,910 INFO L93 Difference]: Finished difference Result 32065 states and 96487 transitions. [2019-12-27 07:52:28,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:28,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 07:52:28,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:28,941 INFO L225 Difference]: With dead ends: 32065 [2019-12-27 07:52:28,941 INFO L226 Difference]: Without dead ends: 16605 [2019-12-27 07:52:28,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-27 07:52:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16605 states. [2019-12-27 07:52:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16605 to 16603. [2019-12-27 07:52:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16603 states. [2019-12-27 07:52:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16603 states to 16603 states and 49251 transitions. [2019-12-27 07:52:29,200 INFO L78 Accepts]: Start accepts. Automaton has 16603 states and 49251 transitions. Word has length 40 [2019-12-27 07:52:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:29,200 INFO L462 AbstractCegarLoop]: Abstraction has 16603 states and 49251 transitions. [2019-12-27 07:52:29,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16603 states and 49251 transitions. [2019-12-27 07:52:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:29,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:29,220 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-27 07:52:29,220 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-27 07:52:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash 559678541, now seen corresponding path program 2 times [2019-12-27 07:52:29,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:29,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790475661] [2019-12-27 07:52:29,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:29,299 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-27 07:52:29,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790475661] [2019-12-27 07:52:29,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:29,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:29,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978348233] [2019-12-27 07:52:29,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:29,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:29,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:29,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:29,301 INFO L87 Difference]: Start difference. First operand 16603 states and 49251 transitions. Second operand 5 states. [2019-12-27 07:52:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:29,989 INFO L93 Difference]: Finished difference Result 22916 states and 67717 transitions. [2019-12-27 07:52:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:52:29,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:30,029 INFO L225 Difference]: With dead ends: 22916 [2019-12-27 07:52:30,029 INFO L226 Difference]: Without dead ends: 22916 [2019-12-27 07:52:30,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:52:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22916 states. [2019-12-27 07:52:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22916 to 21410. [2019-12-27 07:52:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-27 07:52:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 63610 transitions. [2019-12-27 07:52:30,374 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 63610 transitions. Word has length 40 [2019-12-27 07:52:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:30,374 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 63610 transitions. [2019-12-27 07:52:30,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 63610 transitions. [2019-12-27 07:52:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:52:30,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:30,395 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-27 07:52:30,395 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-27 07:52:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash 698759109, now seen corresponding path program 3 times [2019-12-27 07:52:30,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:30,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478810553] [2019-12-27 07:52:30,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:30,458 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-27 07:52:30,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478810553] [2019-12-27 07:52:30,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:30,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:30,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142961721] [2019-12-27 07:52:30,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:30,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:30,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:30,461 INFO L87 Difference]: Start difference. First operand 21410 states and 63610 transitions. Second operand 5 states. [2019-12-27 07:52:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:30,562 INFO L93 Difference]: Finished difference Result 20165 states and 60739 transitions. [2019-12-27 07:52:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:30,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 07:52:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:30,598 INFO L225 Difference]: With dead ends: 20165 [2019-12-27 07:52:30,598 INFO L226 Difference]: Without dead ends: 19671 [2019-12-27 07:52:30,599 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-27 07:52:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states. [2019-12-27 07:52:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 18831. [2019-12-27 07:52:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18831 states. [2019-12-27 07:52:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18831 states to 18831 states and 57508 transitions. [2019-12-27 07:52:31,121 INFO L78 Accepts]: Start accepts. Automaton has 18831 states and 57508 transitions. Word has length 40 [2019-12-27 07:52:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 18831 states and 57508 transitions. [2019-12-27 07:52:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 18831 states and 57508 transitions. [2019-12-27 07:52:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:31,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:31,150 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-27 07:52:31,151 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-27 07:52:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:31,151 INFO L82 PathProgramCache]: Analyzing trace with hash -19391093, now seen corresponding path program 1 times [2019-12-27 07:52:31,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:31,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054754855] [2019-12-27 07:52:31,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:31,463 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-27 07:52:31,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054754855] [2019-12-27 07:52:31,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:31,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:31,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656904695] [2019-12-27 07:52:31,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:31,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:31,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:31,465 INFO L87 Difference]: Start difference. First operand 18831 states and 57508 transitions. Second operand 3 states. [2019-12-27 07:52:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:31,591 INFO L93 Difference]: Finished difference Result 27792 states and 85045 transitions. [2019-12-27 07:52:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:31,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:52:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:31,640 INFO L225 Difference]: With dead ends: 27792 [2019-12-27 07:52:31,641 INFO L226 Difference]: Without dead ends: 27792 [2019-12-27 07:52:31,646 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-27 07:52:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27792 states. [2019-12-27 07:52:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27792 to 21217. [2019-12-27 07:52:31,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21217 states. [2019-12-27 07:52:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21217 states to 21217 states and 65595 transitions. [2019-12-27 07:52:32,003 INFO L78 Accepts]: Start accepts. Automaton has 21217 states and 65595 transitions. Word has length 64 [2019-12-27 07:52:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:32,003 INFO L462 AbstractCegarLoop]: Abstraction has 21217 states and 65595 transitions. [2019-12-27 07:52:32,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21217 states and 65595 transitions. [2019-12-27 07:52:32,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:32,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:32,032 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-27 07:52:32,033 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-27 07:52:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -776574144, now seen corresponding path program 1 times [2019-12-27 07:52:32,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:32,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005460185] [2019-12-27 07:52:32,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:32,118 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-27 07:52:32,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005460185] [2019-12-27 07:52:32,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:32,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:32,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559243848] [2019-12-27 07:52:32,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:32,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:32,120 INFO L87 Difference]: Start difference. First operand 21217 states and 65595 transitions. Second operand 7 states. [2019-12-27 07:52:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:32,659 INFO L93 Difference]: Finished difference Result 62594 states and 191097 transitions. [2019-12-27 07:52:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 07:52:32,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:32,718 INFO L225 Difference]: With dead ends: 62594 [2019-12-27 07:52:32,718 INFO L226 Difference]: Without dead ends: 42982 [2019-12-27 07:52:32,719 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-27 07:52:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42982 states. [2019-12-27 07:52:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42982 to 24204. [2019-12-27 07:52:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24204 states. [2019-12-27 07:52:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24204 states to 24204 states and 74744 transitions. [2019-12-27 07:52:33,222 INFO L78 Accepts]: Start accepts. Automaton has 24204 states and 74744 transitions. Word has length 64 [2019-12-27 07:52:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:33,222 INFO L462 AbstractCegarLoop]: Abstraction has 24204 states and 74744 transitions. [2019-12-27 07:52:33,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 24204 states and 74744 transitions. [2019-12-27 07:52:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:33,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:33,485 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-27 07:52:33,485 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-27 07:52:33,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:33,485 INFO L82 PathProgramCache]: Analyzing trace with hash 4176110, now seen corresponding path program 2 times [2019-12-27 07:52:33,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:33,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570504168] [2019-12-27 07:52:33,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:33,590 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-27 07:52:33,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570504168] [2019-12-27 07:52:33,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:33,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:33,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205401222] [2019-12-27 07:52:33,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:33,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:33,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:33,592 INFO L87 Difference]: Start difference. First operand 24204 states and 74744 transitions. Second operand 7 states. [2019-12-27 07:52:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:34,183 INFO L93 Difference]: Finished difference Result 70069 states and 215496 transitions. [2019-12-27 07:52:34,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:52:34,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:34,281 INFO L225 Difference]: With dead ends: 70069 [2019-12-27 07:52:34,281 INFO L226 Difference]: Without dead ends: 52756 [2019-12-27 07:52:34,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:52:34,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52756 states. [2019-12-27 07:52:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52756 to 28331. [2019-12-27 07:52:34,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28331 states. [2019-12-27 07:52:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28331 states to 28331 states and 88059 transitions. [2019-12-27 07:52:34,965 INFO L78 Accepts]: Start accepts. Automaton has 28331 states and 88059 transitions. Word has length 64 [2019-12-27 07:52:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:34,965 INFO L462 AbstractCegarLoop]: Abstraction has 28331 states and 88059 transitions. [2019-12-27 07:52:34,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 28331 states and 88059 transitions. [2019-12-27 07:52:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:35,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:35,002 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-27 07:52:35,002 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-27 07:52:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1890015084, now seen corresponding path program 3 times [2019-12-27 07:52:35,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:35,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306675873] [2019-12-27 07:52:35,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:35,092 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-27 07:52:35,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306675873] [2019-12-27 07:52:35,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:35,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:35,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053789943] [2019-12-27 07:52:35,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:35,098 INFO L87 Difference]: Start difference. First operand 28331 states and 88059 transitions. Second operand 7 states. [2019-12-27 07:52:35,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:35,582 INFO L93 Difference]: Finished difference Result 60139 states and 184623 transitions. [2019-12-27 07:52:35,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:52:35,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 07:52:35,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:35,656 INFO L225 Difference]: With dead ends: 60139 [2019-12-27 07:52:35,656 INFO L226 Difference]: Without dead ends: 52780 [2019-12-27 07:52:35,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:52:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52780 states. [2019-12-27 07:52:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52780 to 28639. [2019-12-27 07:52:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28639 states. [2019-12-27 07:52:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28639 states to 28639 states and 89010 transitions. [2019-12-27 07:52:36,478 INFO L78 Accepts]: Start accepts. Automaton has 28639 states and 89010 transitions. Word has length 64 [2019-12-27 07:52:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:36,479 INFO L462 AbstractCegarLoop]: Abstraction has 28639 states and 89010 transitions. [2019-12-27 07:52:36,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 28639 states and 89010 transitions. [2019-12-27 07:52:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 07:52:36,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:36,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 07:52:36,509 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-27 07:52:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:36,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1583546656, now seen corresponding path program 4 times [2019-12-27 07:52:36,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:36,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858375539] [2019-12-27 07:52:36,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:36,575 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-27 07:52:36,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858375539] [2019-12-27 07:52:36,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:36,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:36,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856986375] [2019-12-27 07:52:36,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:36,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:36,577 INFO L87 Difference]: Start difference. First operand 28639 states and 89010 transitions. Second operand 3 states. [2019-12-27 07:52:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:36,739 INFO L93 Difference]: Finished difference Result 34404 states and 106219 transitions. [2019-12-27 07:52:36,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:36,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 07:52:36,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:36,785 INFO L225 Difference]: With dead ends: 34404 [2019-12-27 07:52:36,785 INFO L226 Difference]: Without dead ends: 34404 [2019-12-27 07:52:36,785 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-27 07:52:36,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34404 states. [2019-12-27 07:52:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34404 to 30218. [2019-12-27 07:52:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30218 states. [2019-12-27 07:52:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30218 states to 30218 states and 93973 transitions. [2019-12-27 07:52:37,286 INFO L78 Accepts]: Start accepts. Automaton has 30218 states and 93973 transitions. Word has length 64 [2019-12-27 07:52:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:37,286 INFO L462 AbstractCegarLoop]: Abstraction has 30218 states and 93973 transitions. [2019-12-27 07:52:37,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 30218 states and 93973 transitions. [2019-12-27 07:52:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:37,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:37,319 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-27 07:52:37,319 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-27 07:52:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1838532524, now seen corresponding path program 1 times [2019-12-27 07:52:37,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:37,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69819792] [2019-12-27 07:52:37,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:37,385 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-27 07:52:37,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69819792] [2019-12-27 07:52:37,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:37,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:37,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486144608] [2019-12-27 07:52:37,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:37,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:37,387 INFO L87 Difference]: Start difference. First operand 30218 states and 93973 transitions. Second operand 4 states. [2019-12-27 07:52:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:37,643 INFO L93 Difference]: Finished difference Result 38058 states and 117223 transitions. [2019-12-27 07:52:37,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:37,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:52:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:37,695 INFO L225 Difference]: With dead ends: 38058 [2019-12-27 07:52:37,695 INFO L226 Difference]: Without dead ends: 38058 [2019-12-27 07:52:37,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38058 states. [2019-12-27 07:52:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38058 to 30836. [2019-12-27 07:52:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30836 states. [2019-12-27 07:52:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30836 states to 30836 states and 95961 transitions. [2019-12-27 07:52:38,425 INFO L78 Accepts]: Start accepts. Automaton has 30836 states and 95961 transitions. Word has length 65 [2019-12-27 07:52:38,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:38,426 INFO L462 AbstractCegarLoop]: Abstraction has 30836 states and 95961 transitions. [2019-12-27 07:52:38,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:38,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30836 states and 95961 transitions. [2019-12-27 07:52:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:38,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:38,459 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-27 07:52:38,460 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-27 07:52:38,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1450523796, now seen corresponding path program 2 times [2019-12-27 07:52:38,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:38,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754469913] [2019-12-27 07:52:38,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:38,517 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-27 07:52:38,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754469913] [2019-12-27 07:52:38,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:38,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:52:38,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992704298] [2019-12-27 07:52:38,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:38,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:38,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:38,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:38,519 INFO L87 Difference]: Start difference. First operand 30836 states and 95961 transitions. Second operand 4 states. [2019-12-27 07:52:38,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:38,882 INFO L93 Difference]: Finished difference Result 48141 states and 150231 transitions. [2019-12-27 07:52:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:52:38,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 07:52:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:38,950 INFO L225 Difference]: With dead ends: 48141 [2019-12-27 07:52:38,950 INFO L226 Difference]: Without dead ends: 48141 [2019-12-27 07:52:38,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48141 states. [2019-12-27 07:52:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48141 to 32995. [2019-12-27 07:52:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32995 states. [2019-12-27 07:52:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32995 states to 32995 states and 103746 transitions. [2019-12-27 07:52:39,590 INFO L78 Accepts]: Start accepts. Automaton has 32995 states and 103746 transitions. Word has length 65 [2019-12-27 07:52:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:39,590 INFO L462 AbstractCegarLoop]: Abstraction has 32995 states and 103746 transitions. [2019-12-27 07:52:39,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32995 states and 103746 transitions. [2019-12-27 07:52:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:39,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:39,624 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-27 07:52:39,624 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-27 07:52:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1631986328, now seen corresponding path program 3 times [2019-12-27 07:52:39,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:39,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325092755] [2019-12-27 07:52:39,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:39,702 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-27 07:52:39,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325092755] [2019-12-27 07:52:39,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:39,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:52:39,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846916802] [2019-12-27 07:52:39,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:39,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:39,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:39,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:39,705 INFO L87 Difference]: Start difference. First operand 32995 states and 103746 transitions. Second operand 7 states. [2019-12-27 07:52:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:40,730 INFO L93 Difference]: Finished difference Result 72421 states and 224911 transitions. [2019-12-27 07:52:40,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:52:40,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:52:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:40,867 INFO L225 Difference]: With dead ends: 72421 [2019-12-27 07:52:40,867 INFO L226 Difference]: Without dead ends: 66202 [2019-12-27 07:52:40,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:52:41,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66202 states. [2019-12-27 07:52:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66202 to 33027. [2019-12-27 07:52:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33027 states. [2019-12-27 07:52:41,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33027 states to 33027 states and 103864 transitions. [2019-12-27 07:52:41,602 INFO L78 Accepts]: Start accepts. Automaton has 33027 states and 103864 transitions. Word has length 65 [2019-12-27 07:52:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:41,602 INFO L462 AbstractCegarLoop]: Abstraction has 33027 states and 103864 transitions. [2019-12-27 07:52:41,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 33027 states and 103864 transitions. [2019-12-27 07:52:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:41,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:41,636 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-27 07:52:41,636 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-27 07:52:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash -855143256, now seen corresponding path program 4 times [2019-12-27 07:52:41,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:41,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233751644] [2019-12-27 07:52:41,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:41,724 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-27 07:52:41,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233751644] [2019-12-27 07:52:41,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:41,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:52:41,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922157446] [2019-12-27 07:52:41,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:52:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:52:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:41,726 INFO L87 Difference]: Start difference. First operand 33027 states and 103864 transitions. Second operand 7 states. [2019-12-27 07:52:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:42,393 INFO L93 Difference]: Finished difference Result 53845 states and 170272 transitions. [2019-12-27 07:52:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:52:42,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:52:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:42,478 INFO L225 Difference]: With dead ends: 53845 [2019-12-27 07:52:42,478 INFO L226 Difference]: Without dead ends: 53845 [2019-12-27 07:52:42,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:52:42,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53845 states. [2019-12-27 07:52:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53845 to 34199. [2019-12-27 07:52:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34199 states. [2019-12-27 07:52:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34199 states to 34199 states and 107426 transitions. [2019-12-27 07:52:43,466 INFO L78 Accepts]: Start accepts. Automaton has 34199 states and 107426 transitions. Word has length 65 [2019-12-27 07:52:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:43,466 INFO L462 AbstractCegarLoop]: Abstraction has 34199 states and 107426 transitions. [2019-12-27 07:52:43,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:52:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34199 states and 107426 transitions. [2019-12-27 07:52:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:43,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:43,505 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-27 07:52:43,505 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-27 07:52:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:43,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1607407314, now seen corresponding path program 1 times [2019-12-27 07:52:43,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:43,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573238358] [2019-12-27 07:52:43,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:43,582 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-27 07:52:43,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573238358] [2019-12-27 07:52:43,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:43,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:52:43,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298239092] [2019-12-27 07:52:43,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:52:43,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:43,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:52:43,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:43,584 INFO L87 Difference]: Start difference. First operand 34199 states and 107426 transitions. Second operand 5 states. [2019-12-27 07:52:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:44,233 INFO L93 Difference]: Finished difference Result 49777 states and 152916 transitions. [2019-12-27 07:52:44,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:52:44,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:52:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:44,309 INFO L225 Difference]: With dead ends: 49777 [2019-12-27 07:52:44,310 INFO L226 Difference]: Without dead ends: 49557 [2019-12-27 07:52:44,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:52:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49557 states. [2019-12-27 07:52:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49557 to 39728. [2019-12-27 07:52:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39728 states. [2019-12-27 07:52:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39728 states to 39728 states and 124203 transitions. [2019-12-27 07:52:45,010 INFO L78 Accepts]: Start accepts. Automaton has 39728 states and 124203 transitions. Word has length 65 [2019-12-27 07:52:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:45,010 INFO L462 AbstractCegarLoop]: Abstraction has 39728 states and 124203 transitions. [2019-12-27 07:52:45,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:52:45,010 INFO L276 IsEmpty]: Start isEmpty. Operand 39728 states and 124203 transitions. [2019-12-27 07:52:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:45,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:45,055 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-27 07:52:45,055 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-27 07:52:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 99240326, now seen corresponding path program 2 times [2019-12-27 07:52:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626877342] [2019-12-27 07:52:45,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:45,174 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-27 07:52:45,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626877342] [2019-12-27 07:52:45,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:45,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:52:45,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287498124] [2019-12-27 07:52:45,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:52:45,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:52:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:52:45,176 INFO L87 Difference]: Start difference. First operand 39728 states and 124203 transitions. Second operand 8 states. [2019-12-27 07:52:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:46,960 INFO L93 Difference]: Finished difference Result 59625 states and 183241 transitions. [2019-12-27 07:52:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:52:46,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 07:52:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:47,056 INFO L225 Difference]: With dead ends: 59625 [2019-12-27 07:52:47,056 INFO L226 Difference]: Without dead ends: 59513 [2019-12-27 07:52:47,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:52:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59513 states. [2019-12-27 07:52:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59513 to 40852. [2019-12-27 07:52:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40852 states. [2019-12-27 07:52:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40852 states to 40852 states and 127127 transitions. [2019-12-27 07:52:47,858 INFO L78 Accepts]: Start accepts. Automaton has 40852 states and 127127 transitions. Word has length 65 [2019-12-27 07:52:47,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:47,858 INFO L462 AbstractCegarLoop]: Abstraction has 40852 states and 127127 transitions. [2019-12-27 07:52:47,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:52:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 40852 states and 127127 transitions. [2019-12-27 07:52:47,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:47,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:47,909 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-27 07:52:47,909 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-27 07:52:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash -154311598, now seen corresponding path program 3 times [2019-12-27 07:52:47,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:47,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369065121] [2019-12-27 07:52:47,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:48,345 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-27 07:52:48,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369065121] [2019-12-27 07:52:48,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:48,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:52:48,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145646365] [2019-12-27 07:52:48,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 07:52:48,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 07:52:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:52:48,348 INFO L87 Difference]: Start difference. First operand 40852 states and 127127 transitions. Second operand 14 states. [2019-12-27 07:52:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:51,029 INFO L93 Difference]: Finished difference Result 58636 states and 179483 transitions. [2019-12-27 07:52:51,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:52:51,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 07:52:51,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:51,123 INFO L225 Difference]: With dead ends: 58636 [2019-12-27 07:52:51,124 INFO L226 Difference]: Without dead ends: 58396 [2019-12-27 07:52:51,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-27 07:52:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58396 states. [2019-12-27 07:52:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58396 to 42556. [2019-12-27 07:52:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42556 states. [2019-12-27 07:52:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42556 states to 42556 states and 132360 transitions. [2019-12-27 07:52:51,982 INFO L78 Accepts]: Start accepts. Automaton has 42556 states and 132360 transitions. Word has length 65 [2019-12-27 07:52:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:51,982 INFO L462 AbstractCegarLoop]: Abstraction has 42556 states and 132360 transitions. [2019-12-27 07:52:51,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 07:52:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 42556 states and 132360 transitions. [2019-12-27 07:52:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:52:52,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:52,033 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-27 07:52:52,033 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-27 07:52:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1583496514, now seen corresponding path program 4 times [2019-12-27 07:52:52,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:52,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465536411] [2019-12-27 07:52:52,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:52,101 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-27 07:52:52,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465536411] [2019-12-27 07:52:52,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:52,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:52:52,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68869314] [2019-12-27 07:52:52,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:52:52,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:52:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:52:52,103 INFO L87 Difference]: Start difference. First operand 42556 states and 132360 transitions. Second operand 3 states. [2019-12-27 07:52:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:52,256 INFO L93 Difference]: Finished difference Result 32256 states and 99112 transitions. [2019-12-27 07:52:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:52:52,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:52:52,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:52,313 INFO L225 Difference]: With dead ends: 32256 [2019-12-27 07:52:52,314 INFO L226 Difference]: Without dead ends: 32256 [2019-12-27 07:52:52,314 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-27 07:52:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32256 states. [2019-12-27 07:52:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32256 to 31162. [2019-12-27 07:52:52,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31162 states. [2019-12-27 07:52:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31162 states to 31162 states and 95592 transitions. [2019-12-27 07:52:52,772 INFO L78 Accepts]: Start accepts. Automaton has 31162 states and 95592 transitions. Word has length 65 [2019-12-27 07:52:52,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:52,773 INFO L462 AbstractCegarLoop]: Abstraction has 31162 states and 95592 transitions. [2019-12-27 07:52:52,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:52:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 31162 states and 95592 transitions. [2019-12-27 07:52:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:52,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:52,805 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-27 07:52:52,805 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-27 07:52:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:52,806 INFO L82 PathProgramCache]: Analyzing trace with hash 199812966, now seen corresponding path program 1 times [2019-12-27 07:52:52,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:52,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139815042] [2019-12-27 07:52:52,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:52,922 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-27 07:52:52,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139815042] [2019-12-27 07:52:52,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:52,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:52:52,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778570872] [2019-12-27 07:52:52,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:52:52,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:52,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:52:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:52,925 INFO L87 Difference]: Start difference. First operand 31162 states and 95592 transitions. Second operand 9 states. [2019-12-27 07:52:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:55,960 INFO L93 Difference]: Finished difference Result 48005 states and 143547 transitions. [2019-12-27 07:52:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 07:52:55,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 07:52:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:56,026 INFO L225 Difference]: With dead ends: 48005 [2019-12-27 07:52:56,026 INFO L226 Difference]: Without dead ends: 47781 [2019-12-27 07:52:56,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 07:52:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47781 states. [2019-12-27 07:52:56,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47781 to 31331. [2019-12-27 07:52:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31331 states. [2019-12-27 07:52:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31331 states to 31331 states and 96159 transitions. [2019-12-27 07:52:56,640 INFO L78 Accepts]: Start accepts. Automaton has 31331 states and 96159 transitions. Word has length 66 [2019-12-27 07:52:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:56,640 INFO L462 AbstractCegarLoop]: Abstraction has 31331 states and 96159 transitions. [2019-12-27 07:52:56,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:52:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31331 states and 96159 transitions. [2019-12-27 07:52:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:56,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:56,677 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-27 07:52:56,678 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-27 07:52:56,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1661859062, now seen corresponding path program 1 times [2019-12-27 07:52:56,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:56,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185280532] [2019-12-27 07:52:56,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:56,797 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-27 07:52:56,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185280532] [2019-12-27 07:52:56,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:56,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:52:56,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048114960] [2019-12-27 07:52:56,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:52:56,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:56,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:52:56,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:52:56,799 INFO L87 Difference]: Start difference. First operand 31331 states and 96159 transitions. Second operand 9 states. [2019-12-27 07:52:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:58,270 INFO L93 Difference]: Finished difference Result 57706 states and 175424 transitions. [2019-12-27 07:52:58,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:52:58,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 07:52:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:58,338 INFO L225 Difference]: With dead ends: 57706 [2019-12-27 07:52:58,338 INFO L226 Difference]: Without dead ends: 44669 [2019-12-27 07:52:58,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:52:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44669 states. [2019-12-27 07:52:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44669 to 32099. [2019-12-27 07:52:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32099 states. [2019-12-27 07:52:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32099 states to 32099 states and 97701 transitions. [2019-12-27 07:52:59,162 INFO L78 Accepts]: Start accepts. Automaton has 32099 states and 97701 transitions. Word has length 66 [2019-12-27 07:52:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:59,162 INFO L462 AbstractCegarLoop]: Abstraction has 32099 states and 97701 transitions. [2019-12-27 07:52:59,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:52:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32099 states and 97701 transitions. [2019-12-27 07:52:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:59,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:59,196 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-27 07:52:59,196 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-27 07:52:59,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1990266554, now seen corresponding path program 2 times [2019-12-27 07:52:59,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:59,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99322017] [2019-12-27 07:52:59,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:52:59,255 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-27 07:52:59,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99322017] [2019-12-27 07:52:59,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:52:59,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:52:59,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810240327] [2019-12-27 07:52:59,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:52:59,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:52:59,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:52:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:52:59,257 INFO L87 Difference]: Start difference. First operand 32099 states and 97701 transitions. Second operand 4 states. [2019-12-27 07:52:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:52:59,422 INFO L93 Difference]: Finished difference Result 32099 states and 97414 transitions. [2019-12-27 07:52:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:52:59,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 07:52:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:52:59,463 INFO L225 Difference]: With dead ends: 32099 [2019-12-27 07:52:59,464 INFO L226 Difference]: Without dead ends: 32099 [2019-12-27 07:52:59,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:52:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32099 states. [2019-12-27 07:52:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32099 to 28464. [2019-12-27 07:52:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28464 states. [2019-12-27 07:52:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28464 states to 28464 states and 85862 transitions. [2019-12-27 07:52:59,894 INFO L78 Accepts]: Start accepts. Automaton has 28464 states and 85862 transitions. Word has length 66 [2019-12-27 07:52:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:52:59,894 INFO L462 AbstractCegarLoop]: Abstraction has 28464 states and 85862 transitions. [2019-12-27 07:52:59,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:52:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28464 states and 85862 transitions. [2019-12-27 07:52:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:52:59,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:52:59,925 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-27 07:52:59,925 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:52:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:52:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -855039682, now seen corresponding path program 2 times [2019-12-27 07:52:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:52:59,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345284732] [2019-12-27 07:52:59,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:52:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:00,069 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-27 07:53:00,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345284732] [2019-12-27 07:53:00,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:00,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:53:00,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850838184] [2019-12-27 07:53:00,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:53:00,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:53:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:53:00,071 INFO L87 Difference]: Start difference. First operand 28464 states and 85862 transitions. Second operand 11 states. [2019-12-27 07:53:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:01,287 INFO L93 Difference]: Finished difference Result 62803 states and 188236 transitions. [2019-12-27 07:53:01,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:53:01,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 07:53:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:01,355 INFO L225 Difference]: With dead ends: 62803 [2019-12-27 07:53:01,355 INFO L226 Difference]: Without dead ends: 49006 [2019-12-27 07:53:01,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:53:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49006 states. [2019-12-27 07:53:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49006 to 27238. [2019-12-27 07:53:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27238 states. [2019-12-27 07:53:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27238 states to 27238 states and 82031 transitions. [2019-12-27 07:53:02,154 INFO L78 Accepts]: Start accepts. Automaton has 27238 states and 82031 transitions. Word has length 66 [2019-12-27 07:53:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:02,154 INFO L462 AbstractCegarLoop]: Abstraction has 27238 states and 82031 transitions. [2019-12-27 07:53:02,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:53:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27238 states and 82031 transitions. [2019-12-27 07:53:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:53:02,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:02,186 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-27 07:53:02,186 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:02,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:02,186 INFO L82 PathProgramCache]: Analyzing trace with hash -503134108, now seen corresponding path program 3 times [2019-12-27 07:53:02,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:02,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917693275] [2019-12-27 07:53:02,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:02,495 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-27 07:53:02,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917693275] [2019-12-27 07:53:02,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:02,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:53:02,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237586558] [2019-12-27 07:53:02,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:53:02,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:53:02,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:53:02,501 INFO L87 Difference]: Start difference. First operand 27238 states and 82031 transitions. Second operand 13 states. [2019-12-27 07:53:08,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:08,055 INFO L93 Difference]: Finished difference Result 72100 states and 215170 transitions. [2019-12-27 07:53:08,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 07:53:08,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-27 07:53:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:08,162 INFO L225 Difference]: With dead ends: 72100 [2019-12-27 07:53:08,162 INFO L226 Difference]: Without dead ends: 72100 [2019-12-27 07:53:08,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=613, Invalid=3293, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 07:53:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72100 states. [2019-12-27 07:53:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72100 to 38514. [2019-12-27 07:53:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38514 states. [2019-12-27 07:53:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38514 states to 38514 states and 115963 transitions. [2019-12-27 07:53:09,249 INFO L78 Accepts]: Start accepts. Automaton has 38514 states and 115963 transitions. Word has length 66 [2019-12-27 07:53:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:09,250 INFO L462 AbstractCegarLoop]: Abstraction has 38514 states and 115963 transitions. [2019-12-27 07:53:09,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:53:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 38514 states and 115963 transitions. [2019-12-27 07:53:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:53:09,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:09,293 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-27 07:53:09,293 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:09,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:09,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1809198528, now seen corresponding path program 4 times [2019-12-27 07:53:09,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:09,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590232357] [2019-12-27 07:53:09,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:09,355 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-27 07:53:09,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590232357] [2019-12-27 07:53:09,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:09,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:09,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370689494] [2019-12-27 07:53:09,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:09,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:09,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:09,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:09,357 INFO L87 Difference]: Start difference. First operand 38514 states and 115963 transitions. Second operand 3 states. [2019-12-27 07:53:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:09,525 INFO L93 Difference]: Finished difference Result 38514 states and 115962 transitions. [2019-12-27 07:53:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:09,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:53:09,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:09,607 INFO L225 Difference]: With dead ends: 38514 [2019-12-27 07:53:09,608 INFO L226 Difference]: Without dead ends: 38514 [2019-12-27 07:53:09,608 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-27 07:53:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38514 states. [2019-12-27 07:53:10,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38514 to 27597. [2019-12-27 07:53:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27597 states. [2019-12-27 07:53:10,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27597 states to 27597 states and 84858 transitions. [2019-12-27 07:53:10,179 INFO L78 Accepts]: Start accepts. Automaton has 27597 states and 84858 transitions. Word has length 66 [2019-12-27 07:53:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:10,179 INFO L462 AbstractCegarLoop]: Abstraction has 27597 states and 84858 transitions. [2019-12-27 07:53:10,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:10,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27597 states and 84858 transitions. [2019-12-27 07:53:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:10,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:10,208 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-27 07:53:10,208 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash 744299942, now seen corresponding path program 1 times [2019-12-27 07:53:10,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:10,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995159130] [2019-12-27 07:53:10,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:10,374 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-27 07:53:10,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995159130] [2019-12-27 07:53:10,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:10,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 07:53:10,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519825916] [2019-12-27 07:53:10,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 07:53:10,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:10,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 07:53:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 07:53:10,376 INFO L87 Difference]: Start difference. First operand 27597 states and 84858 transitions. Second operand 12 states. [2019-12-27 07:53:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:11,498 INFO L93 Difference]: Finished difference Result 41889 states and 128388 transitions. [2019-12-27 07:53:11,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 07:53:11,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 07:53:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:11,559 INFO L225 Difference]: With dead ends: 41889 [2019-12-27 07:53:11,559 INFO L226 Difference]: Without dead ends: 41460 [2019-12-27 07:53:11,560 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-27 07:53:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41460 states. [2019-12-27 07:53:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41460 to 27343. [2019-12-27 07:53:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 07:53:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 84210 transitions. [2019-12-27 07:53:12,085 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 84210 transitions. Word has length 67 [2019-12-27 07:53:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:12,086 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 84210 transitions. [2019-12-27 07:53:12,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 07:53:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 84210 transitions. [2019-12-27 07:53:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:53:12,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:12,117 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-27 07:53:12,117 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:12,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:12,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 07:53:12,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:12,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517658388] [2019-12-27 07:53:12,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:12,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:53:12,463 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:53:12,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 |v_ULTIMATE.start_main_~#t2287~0.offset_17|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2287~0.base_23|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23| 1)) (= 0 v_~z$w_buff1_used~0_77) (= 0 v_~z$w_buff1~0_28) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2287~0.base_23| 4)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2287~0.base_23|) 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (= v_~z$r_buff0_thd1~0_22 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2287~0.base_23|) |v_ULTIMATE.start_main_~#t2287~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t2287~0.base=|v_ULTIMATE.start_main_~#t2287~0.base_23|, ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_17|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2287~0.offset=|v_ULTIMATE.start_main_~#t2287~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, ULTIMATE.start_main_~#t2289~0.offset, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2288~0.offset, ULTIMATE.start_main_~#t2289~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2287~0.base, #NULL.base, ULTIMATE.start_main_~#t2287~0.offset, ULTIMATE.start_main_~#t2288~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 07:53:12,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2288~0.base_9| 0)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2288~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2288~0.base_9|) |v_ULTIMATE.start_main_~#t2288~0.offset_8| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2288~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2288~0.offset_8|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2288~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2288~0.base=|v_ULTIMATE.start_main_~#t2288~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2288~0.offset=|v_ULTIMATE.start_main_~#t2288~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2288~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2288~0.offset] because there is no mapped edge [2019-12-27 07:53:12,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-1604455052 ~z$w_buff0_used~0_In-1604455052) (= 1 ~z$w_buff0~0_Out-1604455052) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1604455052|) (= 1 ~z$w_buff0_used~0_Out-1604455052) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1604455052| P0Thread1of1ForFork0_~arg.offset_Out-1604455052) (= |P0Thread1of1ForFork0_#in~arg.base_In-1604455052| P0Thread1of1ForFork0_~arg.base_Out-1604455052) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1604455052 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1604455052|) (= (mod ~z$w_buff1_used~0_Out-1604455052 256) 0) (= ~z$w_buff0~0_In-1604455052 ~z$w_buff1~0_Out-1604455052)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1604455052|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1604455052, ~z$w_buff0~0=~z$w_buff0~0_In-1604455052, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1604455052|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1604455052|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1604455052, ~z$w_buff0~0=~z$w_buff0~0_Out-1604455052, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1604455052, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1604455052, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1604455052|, ~z$w_buff1~0=~z$w_buff1~0_Out-1604455052, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1604455052, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1604455052|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1604455052} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 07:53:12,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2289~0.base_11|) |v_ULTIMATE.start_main_~#t2289~0.offset_9| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2289~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2289~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2289~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2289~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2289~0.offset=|v_ULTIMATE.start_main_~#t2289~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2289~0.base=|v_ULTIMATE.start_main_~#t2289~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2289~0.offset, #length, ULTIMATE.start_main_~#t2289~0.base] because there is no mapped edge [2019-12-27 07:53:12,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1058825454| |P1Thread1of1ForFork1_#t~ite10_Out-1058825454|)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1058825454 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1058825454 256) 0))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-1058825454| ~z$w_buff1~0_In-1058825454) (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out-1058825454| ~z~0_In-1058825454)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1058825454, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1058825454, ~z$w_buff1~0=~z$w_buff1~0_In-1058825454, ~z~0=~z~0_In-1058825454} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1058825454|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1058825454, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1058825454, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1058825454|, ~z$w_buff1~0=~z$w_buff1~0_In-1058825454, ~z~0=~z~0_In-1058825454} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 07:53:12,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-543006064 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-543006064 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-543006064|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-543006064 |P1Thread1of1ForFork1_#t~ite11_Out-543006064|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-543006064, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-543006064} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-543006064, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-543006064|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-543006064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:53:12,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In694216407 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In694216407 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In694216407 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In694216407 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In694216407 |P1Thread1of1ForFork1_#t~ite12_Out694216407|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out694216407| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In694216407, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In694216407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694216407, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In694216407} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In694216407, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In694216407, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694216407, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out694216407|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In694216407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:53:12,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1312327236 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1312327236 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1312327236|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1312327236 |P1Thread1of1ForFork1_#t~ite13_Out1312327236|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1312327236, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1312327236} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1312327236, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1312327236|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1312327236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:53:12,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1131515736 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In1131515736| |P2Thread1of1ForFork2_#t~ite23_Out1131515736|) (= ~z$w_buff1~0_In1131515736 |P2Thread1of1ForFork2_#t~ite24_Out1131515736|)) (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1131515736 256)))) (or (= (mod ~z$w_buff0_used~0_In1131515736 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1131515736 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1131515736 256) 0)))) (= ~z$w_buff1~0_In1131515736 |P2Thread1of1ForFork2_#t~ite23_Out1131515736|) (= |P2Thread1of1ForFork2_#t~ite23_Out1131515736| |P2Thread1of1ForFork2_#t~ite24_Out1131515736|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1131515736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1131515736, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1131515736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1131515736, ~z$w_buff1~0=~z$w_buff1~0_In1131515736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1131515736, ~weak$$choice2~0=~weak$$choice2~0_In1131515736} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1131515736|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1131515736|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1131515736, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1131515736, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1131515736, ~z$w_buff1~0=~z$w_buff1~0_In1131515736, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1131515736, ~weak$$choice2~0=~weak$$choice2~0_In1131515736} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 07:53:12,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In196733624 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_In196733624| |P2Thread1of1ForFork2_#t~ite26_Out196733624|) (= |P2Thread1of1ForFork2_#t~ite27_Out196733624| ~z$w_buff0_used~0_In196733624) (not .cse0)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In196733624 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In196733624 256)) (and (= (mod ~z$r_buff1_thd3~0_In196733624 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In196733624 256)) .cse1))) (= |P2Thread1of1ForFork2_#t~ite27_Out196733624| |P2Thread1of1ForFork2_#t~ite26_Out196733624|) (= ~z$w_buff0_used~0_In196733624 |P2Thread1of1ForFork2_#t~ite26_Out196733624|) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In196733624|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In196733624, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In196733624, ~z$w_buff1_used~0=~z$w_buff1_used~0_In196733624, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In196733624, ~weak$$choice2~0=~weak$$choice2~0_In196733624} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out196733624|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In196733624, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In196733624, ~z$w_buff1_used~0=~z$w_buff1_used~0_In196733624, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In196733624, ~weak$$choice2~0=~weak$$choice2~0_In196733624, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out196733624|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 07:53:12,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-2088859357 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2088859357 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2088859357 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-2088859357 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-2088859357| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-2088859357 |P1Thread1of1ForFork1_#t~ite14_Out-2088859357|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2088859357, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2088859357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2088859357, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2088859357} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2088859357, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2088859357, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2088859357, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2088859357|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2088859357} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:53:12,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:53:12,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1579235949 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1579235949 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-1579235949 256) 0) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1579235949 256)) (and (= (mod ~z$r_buff1_thd3~0_In-1579235949 256) 0) .cse0))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1579235949| |P2Thread1of1ForFork2_#t~ite30_Out-1579235949|) (= ~z$w_buff1_used~0_In-1579235949 |P2Thread1of1ForFork2_#t~ite29_Out-1579235949|) .cse1) (and (not .cse1) (= ~z$w_buff1_used~0_In-1579235949 |P2Thread1of1ForFork2_#t~ite30_Out-1579235949|) (= |P2Thread1of1ForFork2_#t~ite29_In-1579235949| |P2Thread1of1ForFork2_#t~ite29_Out-1579235949|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1579235949, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1579235949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1579235949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1579235949, ~weak$$choice2~0=~weak$$choice2~0_In-1579235949, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1579235949|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1579235949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1579235949, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1579235949, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1579235949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1579235949, ~weak$$choice2~0=~weak$$choice2~0_In-1579235949, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1579235949|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 07:53:12,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 07:53:12,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 07:53:12,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1534281958 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1534281958 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1534281958| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1534281958| ~z$w_buff0_used~0_In1534281958)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1534281958, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1534281958} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1534281958|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1534281958, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1534281958} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:53:12,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In1145980453 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1145980453 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1145980453 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1145980453 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1145980453 |P0Thread1of1ForFork0_#t~ite6_Out1145980453|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1145980453| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1145980453, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1145980453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1145980453, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1145980453} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1145980453|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1145980453, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1145980453, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1145980453, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1145980453} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:53:12,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-2021590195 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-2021590195 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-2021590195)) (and (= ~z$r_buff0_thd1~0_In-2021590195 ~z$r_buff0_thd1~0_Out-2021590195) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2021590195, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2021590195} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2021590195, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2021590195|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2021590195} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:53:12,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-865799350 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-865799350 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-865799350 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-865799350 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-865799350 |P0Thread1of1ForFork0_#t~ite8_Out-865799350|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-865799350|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-865799350, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-865799350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865799350, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-865799350} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-865799350, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-865799350|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-865799350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865799350, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-865799350} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:53:12,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:53:12,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1813297988 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out1813297988| |P2Thread1of1ForFork2_#t~ite39_Out1813297988|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1813297988 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out1813297988| ~z~0_In1813297988)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out1813297988| ~z$w_buff1~0_In1813297988) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1813297988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1813297988, ~z$w_buff1~0=~z$w_buff1~0_In1813297988, ~z~0=~z~0_In1813297988} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1813297988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1813297988, ~z$w_buff1~0=~z$w_buff1~0_In1813297988, ~z~0=~z~0_In1813297988, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out1813297988|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out1813297988|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 07:53:12,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1886567567 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1886567567 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1886567567 |P2Thread1of1ForFork2_#t~ite40_Out-1886567567|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1886567567|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1886567567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1886567567} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1886567567, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1886567567, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1886567567|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 07:53:12,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1666854252 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1666854252 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1666854252 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1666854252 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1666854252 |P2Thread1of1ForFork2_#t~ite41_Out1666854252|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1666854252| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1666854252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1666854252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1666854252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1666854252} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1666854252|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1666854252, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1666854252, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1666854252, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1666854252} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 07:53:12,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In263052814 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In263052814 256)))) (or (and (= ~z$r_buff0_thd3~0_In263052814 |P2Thread1of1ForFork2_#t~ite42_Out263052814|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out263052814|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In263052814, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In263052814} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out263052814|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In263052814, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In263052814} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 07:53:12,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-637358959 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-637358959 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-637358959 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-637358959 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-637358959 |P2Thread1of1ForFork2_#t~ite43_Out-637358959|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite43_Out-637358959| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-637358959, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-637358959, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-637358959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-637358959} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-637358959, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-637358959, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-637358959|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-637358959, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-637358959} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 07:53:12,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:53:12,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 07:53:12,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out670741732| |ULTIMATE.start_main_#t~ite47_Out670741732|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In670741732 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In670741732 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out670741732| ~z$w_buff1~0_In670741732)) (and .cse0 (or .cse2 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out670741732| ~z~0_In670741732)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In670741732, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670741732, ~z$w_buff1~0=~z$w_buff1~0_In670741732, ~z~0=~z~0_In670741732} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In670741732, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out670741732|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670741732, ~z$w_buff1~0=~z$w_buff1~0_In670741732, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out670741732|, ~z~0=~z~0_In670741732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:53:12,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-132299949 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-132299949 256) 0))) (or (and (= ~z$w_buff0_used~0_In-132299949 |ULTIMATE.start_main_#t~ite49_Out-132299949|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-132299949|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-132299949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132299949} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-132299949, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132299949, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-132299949|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 07:53:12,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-1657350762 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1657350762 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1657350762 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1657350762 256)))) (or (and (= ~z$w_buff1_used~0_In-1657350762 |ULTIMATE.start_main_#t~ite50_Out-1657350762|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1657350762|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1657350762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1657350762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1657350762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1657350762} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1657350762|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1657350762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1657350762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1657350762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1657350762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 07:53:12,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1294373134 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1294373134 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1294373134| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out1294373134| ~z$r_buff0_thd0~0_In1294373134) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1294373134, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1294373134} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1294373134, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1294373134|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1294373134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 07:53:12,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1204577166 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1204577166 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1204577166 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1204577166 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1204577166| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1204577166| ~z$r_buff1_thd0~0_In-1204577166) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1204577166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1204577166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1204577166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1204577166} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1204577166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1204577166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1204577166, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1204577166, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1204577166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 07:53:12,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:53:12,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:53:12 BasicIcfg [2019-12-27 07:53:12,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:53:12,570 INFO L168 Benchmark]: Toolchain (without parser) took 109220.42 ms. Allocated memory was 144.2 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,571 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.25 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,572 INFO L168 Benchmark]: Boogie Preprocessor took 48.29 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,573 INFO L168 Benchmark]: RCFGBuilder took 891.22 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 101.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,573 INFO L168 Benchmark]: TraceAbstraction took 107355.63 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:53:12,576 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 848.25 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.3 MB in the beginning and 156.5 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.94 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.29 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.22 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 101.1 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107355.63 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6847 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2289, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.0s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7482 SDtfs, 9351 SDslu, 26222 SDs, 0 SdLazy, 17528 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 68 SyntacticMatches, 32 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred 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: 37.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 365669 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1580 ConstructedInterpolants, 0 QuantifiedInterpolants, 348792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...