/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/mix038_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:23:02,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:23:02,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:23:02,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:23:02,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:23:02,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:23:02,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:23:02,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:23:02,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:23:02,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:23:02,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:23:02,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:23:02,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:23:02,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:23:02,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:23:02,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:23:02,220 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:23:02,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:23:02,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:23:02,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:23:02,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:23:02,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:23:02,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:23:02,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:23:02,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:23:02,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:23:02,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:23:02,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:23:02,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:23:02,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:23:02,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:23:02,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:23:02,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:23:02,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:23:02,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:23:02,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:23:02,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:23:02,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:23:02,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:23:02,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:23:02,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:23:02,253 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 06:23:02,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:23:02,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:23:02,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:23:02,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:23:02,281 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:23:02,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:23:02,281 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:23:02,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:23:02,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:23:02,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:23:02,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:23:02,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:23:02,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:23:02,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:23:02,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:23:02,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:23:02,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:23:02,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:23:02,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:23:02,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:23:02,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:23:02,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:23:02,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:23:02,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:23:02,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:23:02,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:23:02,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:23:02,285 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:23:02,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:23:02,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:23:02,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:23:02,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:23:02,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:23:02,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:23:02,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:23:02,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 06:23:02,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d674dc0fd/8813c47a715f4036bec2e42a53f6df3d/FLAGd6f2da6e2 [2019-12-27 06:23:03,228 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:23:03,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_rmo.oepc.i [2019-12-27 06:23:03,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d674dc0fd/8813c47a715f4036bec2e42a53f6df3d/FLAGd6f2da6e2 [2019-12-27 06:23:03,500 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d674dc0fd/8813c47a715f4036bec2e42a53f6df3d [2019-12-27 06:23:03,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:23:03,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:23:03,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:03,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:23:03,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:23:03,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:03" (1/1) ... [2019-12-27 06:23:03,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166c5411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:03, skipping insertion in model container [2019-12-27 06:23:03,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:23:03" (1/1) ... [2019-12-27 06:23:03,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:23:03,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:23:04,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:04,207 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:23:04,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:23:04,378 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:23:04,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04 WrapperNode [2019-12-27 06:23:04,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:23:04,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:04,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:23:04,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:23:04,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:23:04,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:23:04,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:23:04,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:23:04,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (1/1) ... [2019-12-27 06:23:04,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:23:04,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:23:04,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:23:04,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:23:04,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (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 06:23:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:23:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:23:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:23:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:23:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:23:04,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:23:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:23:04,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:23:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:23:04,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:23:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:23:04,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:23:04,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:23:04,554 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 06:23:05,327 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:23:05,327 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:23:05,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:05 BoogieIcfgContainer [2019-12-27 06:23:05,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:23:05,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:23:05,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:23:05,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:23:05,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:23:03" (1/3) ... [2019-12-27 06:23:05,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58289f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:05, skipping insertion in model container [2019-12-27 06:23:05,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:23:04" (2/3) ... [2019-12-27 06:23:05,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58289f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:23:05, skipping insertion in model container [2019-12-27 06:23:05,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:23:05" (3/3) ... [2019-12-27 06:23:05,336 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-27 06:23:05,345 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:23:05,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:23:05,354 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:23:05,356 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:23:05,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,428 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,428 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,457 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,465 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,467 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:23:05,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:23:05,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:23:05,504 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:23:05,504 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:23:05,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:23:05,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:23:05,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:23:05,505 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:23:05,505 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:23:05,522 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 06:23:05,524 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:23:05,642 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:23:05,642 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:05,659 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:23:05,682 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 06:23:05,751 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 06:23:05,752 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:23:05,763 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:23:05,787 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:23:05,788 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:23:09,405 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 06:23:09,532 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 06:23:09,553 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 06:23:09,554 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 06:23:09,558 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:23:25,968 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 06:23:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 06:23:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:23:25,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:25,977 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:23:25,977 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 06:23:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 06:23:25,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:25,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512420960] [2019-12-27 06:23:25,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:26,225 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 06:23:26,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512420960] [2019-12-27 06:23:26,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:26,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:23:26,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348952267] [2019-12-27 06:23:26,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:26,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:26,244 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 06:23:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:29,259 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 06:23:29,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:29,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:23:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:29,822 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 06:23:29,822 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 06:23:29,832 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 06:23:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 06:23:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 06:23:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 06:23:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 06:23:36,958 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 06:23:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:36,958 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 06:23:36,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:23:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 06:23:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:23:36,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:36,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:36,963 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 06:23:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:36,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 06:23:36,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:36,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291138068] [2019-12-27 06:23:36,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:37,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 06:23:37,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291138068] [2019-12-27 06:23:37,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:37,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:37,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875053665] [2019-12-27 06:23:37,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:23:37,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:23:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:23:37,073 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 06:23:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:42,321 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 06:23:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:23:42,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:23:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:43,096 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 06:23:43,096 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 06:23:43,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:23:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 06:23:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 06:23:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 06:23:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 06:23:55,015 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 06:23:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:23:55,016 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 06:23:55,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:23:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 06:23:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:23:55,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:23:55,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:23:55,024 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 06:23:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:23:55,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 06:23:55,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:23:55,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607585493] [2019-12-27 06:23:55,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:23:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:23:55,088 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 06:23:55,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607585493] [2019-12-27 06:23:55,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:23:55,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:23:55,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220303388] [2019-12-27 06:23:55,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:23:55,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:23:55,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:23:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:23:55,091 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 06:23:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:23:55,221 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 06:23:55,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:23:55,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:23:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:23:55,283 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 06:23:55,283 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 06:23:55,284 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 06:23:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 06:24:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 06:24:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 06:24:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 06:24:00,492 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 06:24:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:00,492 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 06:24:00,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:00,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 06:24:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:24:00,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:00,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:00,496 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 06:24:00,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 06:24:00,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:00,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243566129] [2019-12-27 06:24:00,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:00,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243566129] [2019-12-27 06:24:00,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:00,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:00,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577317312] [2019-12-27 06:24:00,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:00,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:00,617 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 06:24:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:00,996 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 06:24:00,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:00,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:24:00,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:01,061 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 06:24:01,061 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 06:24:01,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 06:24:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 06:24:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 06:24:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 06:24:01,690 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 06:24:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:01,691 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 06:24:01,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 06:24:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:24:01,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:01,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:01,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:01,700 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 06:24:01,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:01,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140214052] [2019-12-27 06:24:01,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:01,822 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 06:24:01,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140214052] [2019-12-27 06:24:01,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:01,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:01,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040147770] [2019-12-27 06:24:01,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:01,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:01,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:01,825 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 6 states. [2019-12-27 06:24:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:03,041 INFO L93 Difference]: Finished difference Result 46852 states and 149591 transitions. [2019-12-27 06:24:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:03,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:24:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:03,126 INFO L225 Difference]: With dead ends: 46852 [2019-12-27 06:24:03,127 INFO L226 Difference]: Without dead ends: 46852 [2019-12-27 06:24:03,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46852 states. [2019-12-27 06:24:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46852 to 35192. [2019-12-27 06:24:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35192 states. [2019-12-27 06:24:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35192 states to 35192 states and 113953 transitions. [2019-12-27 06:24:03,803 INFO L78 Accepts]: Start accepts. Automaton has 35192 states and 113953 transitions. Word has length 22 [2019-12-27 06:24:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:03,804 INFO L462 AbstractCegarLoop]: Abstraction has 35192 states and 113953 transitions. [2019-12-27 06:24:03,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 35192 states and 113953 transitions. [2019-12-27 06:24:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:24:03,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:03,811 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 06:24:03,812 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 06:24:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:03,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1330562352, now seen corresponding path program 2 times [2019-12-27 06:24:03,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:03,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397344568] [2019-12-27 06:24:03,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:03,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397344568] [2019-12-27 06:24:03,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:03,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:03,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690437205] [2019-12-27 06:24:03,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:03,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:03,960 INFO L87 Difference]: Start difference. First operand 35192 states and 113953 transitions. Second operand 6 states. [2019-12-27 06:24:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:04,683 INFO L93 Difference]: Finished difference Result 49672 states and 158594 transitions. [2019-12-27 06:24:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:24:04,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:24:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:04,767 INFO L225 Difference]: With dead ends: 49672 [2019-12-27 06:24:04,767 INFO L226 Difference]: Without dead ends: 49665 [2019-12-27 06:24:04,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:24:05,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49665 states. [2019-12-27 06:24:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49665 to 34769. [2019-12-27 06:24:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34769 states. [2019-12-27 06:24:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34769 states to 34769 states and 112426 transitions. [2019-12-27 06:24:05,780 INFO L78 Accepts]: Start accepts. Automaton has 34769 states and 112426 transitions. Word has length 22 [2019-12-27 06:24:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:05,780 INFO L462 AbstractCegarLoop]: Abstraction has 34769 states and 112426 transitions. [2019-12-27 06:24:05,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 34769 states and 112426 transitions. [2019-12-27 06:24:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:24:05,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:05,792 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 06:24:05,792 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 06:24:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:05,792 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 06:24:05,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:05,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356898039] [2019-12-27 06:24:05,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:05,844 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 06:24:05,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356898039] [2019-12-27 06:24:05,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:05,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:05,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655929795] [2019-12-27 06:24:05,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:05,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:05,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:05,847 INFO L87 Difference]: Start difference. First operand 34769 states and 112426 transitions. Second operand 4 states. [2019-12-27 06:24:05,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:05,914 INFO L93 Difference]: Finished difference Result 14037 states and 42744 transitions. [2019-12-27 06:24:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:05,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:24:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:05,942 INFO L225 Difference]: With dead ends: 14037 [2019-12-27 06:24:05,942 INFO L226 Difference]: Without dead ends: 14037 [2019-12-27 06:24:05,942 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 06:24:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-12-27 06:24:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 13737. [2019-12-27 06:24:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13737 states. [2019-12-27 06:24:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13737 states to 13737 states and 41888 transitions. [2019-12-27 06:24:06,151 INFO L78 Accepts]: Start accepts. Automaton has 13737 states and 41888 transitions. Word has length 25 [2019-12-27 06:24:06,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:06,152 INFO L462 AbstractCegarLoop]: Abstraction has 13737 states and 41888 transitions. [2019-12-27 06:24:06,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 13737 states and 41888 transitions. [2019-12-27 06:24:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:24:06,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:06,161 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 06:24:06,161 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 06:24:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 06:24:06,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:06,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778837316] [2019-12-27 06:24:06,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:06,209 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 06:24:06,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778837316] [2019-12-27 06:24:06,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:06,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:06,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93555361] [2019-12-27 06:24:06,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:06,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:06,211 INFO L87 Difference]: Start difference. First operand 13737 states and 41888 transitions. Second operand 3 states. [2019-12-27 06:24:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:06,335 INFO L93 Difference]: Finished difference Result 19578 states and 58714 transitions. [2019-12-27 06:24:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:06,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:24:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:06,380 INFO L225 Difference]: With dead ends: 19578 [2019-12-27 06:24:06,380 INFO L226 Difference]: Without dead ends: 19578 [2019-12-27 06:24:06,381 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 06:24:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-27 06:24:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 14483. [2019-12-27 06:24:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14483 states. [2019-12-27 06:24:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14483 states to 14483 states and 44026 transitions. [2019-12-27 06:24:06,740 INFO L78 Accepts]: Start accepts. Automaton has 14483 states and 44026 transitions. Word has length 27 [2019-12-27 06:24:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:06,741 INFO L462 AbstractCegarLoop]: Abstraction has 14483 states and 44026 transitions. [2019-12-27 06:24:06,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14483 states and 44026 transitions. [2019-12-27 06:24:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:24:06,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:06,751 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 06:24:06,751 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 06:24:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 06:24:06,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:06,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572577980] [2019-12-27 06:24:06,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:06,829 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 06:24:06,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572577980] [2019-12-27 06:24:06,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:06,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:06,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267023951] [2019-12-27 06:24:06,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:06,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:06,831 INFO L87 Difference]: Start difference. First operand 14483 states and 44026 transitions. Second operand 6 states. [2019-12-27 06:24:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:07,714 INFO L93 Difference]: Finished difference Result 37116 states and 111342 transitions. [2019-12-27 06:24:07,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:07,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:24:07,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:07,780 INFO L225 Difference]: With dead ends: 37116 [2019-12-27 06:24:07,780 INFO L226 Difference]: Without dead ends: 37116 [2019-12-27 06:24:07,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37116 states. [2019-12-27 06:24:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37116 to 20406. [2019-12-27 06:24:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:24:08,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 62963 transitions. [2019-12-27 06:24:08,239 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 62963 transitions. Word has length 27 [2019-12-27 06:24:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:08,240 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 62963 transitions. [2019-12-27 06:24:08,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:08,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 62963 transitions. [2019-12-27 06:24:08,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:24:08,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:08,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:08,254 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 06:24:08,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:08,255 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 06:24:08,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:08,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914016160] [2019-12-27 06:24:08,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:08,336 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 06:24:08,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914016160] [2019-12-27 06:24:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:08,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456510849] [2019-12-27 06:24:08,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:08,338 INFO L87 Difference]: Start difference. First operand 20406 states and 62963 transitions. Second operand 6 states. [2019-12-27 06:24:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:09,042 INFO L93 Difference]: Finished difference Result 34406 states and 103078 transitions. [2019-12-27 06:24:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:09,043 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 06:24:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:09,092 INFO L225 Difference]: With dead ends: 34406 [2019-12-27 06:24:09,092 INFO L226 Difference]: Without dead ends: 34406 [2019-12-27 06:24:09,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34406 states. [2019-12-27 06:24:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34406 to 20168. [2019-12-27 06:24:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20168 states. [2019-12-27 06:24:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20168 states to 20168 states and 62348 transitions. [2019-12-27 06:24:09,506 INFO L78 Accepts]: Start accepts. Automaton has 20168 states and 62348 transitions. Word has length 28 [2019-12-27 06:24:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:09,506 INFO L462 AbstractCegarLoop]: Abstraction has 20168 states and 62348 transitions. [2019-12-27 06:24:09,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20168 states and 62348 transitions. [2019-12-27 06:24:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:24:09,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:09,529 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 06:24:09,530 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 06:24:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 06:24:09,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:09,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434481497] [2019-12-27 06:24:09,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:09,620 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 06:24:09,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434481497] [2019-12-27 06:24:09,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:09,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:09,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447997739] [2019-12-27 06:24:09,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:09,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:09,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:09,623 INFO L87 Difference]: Start difference. First operand 20168 states and 62348 transitions. Second operand 7 states. [2019-12-27 06:24:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:11,289 INFO L93 Difference]: Finished difference Result 46484 states and 138730 transitions. [2019-12-27 06:24:11,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:24:11,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:24:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:11,356 INFO L225 Difference]: With dead ends: 46484 [2019-12-27 06:24:11,356 INFO L226 Difference]: Without dead ends: 46484 [2019-12-27 06:24:11,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 06:24:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46484 states. [2019-12-27 06:24:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46484 to 21453. [2019-12-27 06:24:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21453 states. [2019-12-27 06:24:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21453 states to 21453 states and 66311 transitions. [2019-12-27 06:24:11,856 INFO L78 Accepts]: Start accepts. Automaton has 21453 states and 66311 transitions. Word has length 33 [2019-12-27 06:24:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 21453 states and 66311 transitions. [2019-12-27 06:24:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21453 states and 66311 transitions. [2019-12-27 06:24:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:24:11,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:11,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:11,878 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 06:24:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 06:24:11,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:11,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683972994] [2019-12-27 06:24:11,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:11,920 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 06:24:11,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683972994] [2019-12-27 06:24:11,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:11,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:11,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8442607] [2019-12-27 06:24:11,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:11,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:11,923 INFO L87 Difference]: Start difference. First operand 21453 states and 66311 transitions. Second operand 3 states. [2019-12-27 06:24:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:12,059 INFO L93 Difference]: Finished difference Result 28695 states and 85785 transitions. [2019-12-27 06:24:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:12,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 06:24:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:12,098 INFO L225 Difference]: With dead ends: 28695 [2019-12-27 06:24:12,098 INFO L226 Difference]: Without dead ends: 28695 [2019-12-27 06:24:12,098 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 06:24:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28695 states. [2019-12-27 06:24:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28695 to 20429. [2019-12-27 06:24:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20429 states. [2019-12-27 06:24:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20429 states to 20429 states and 61164 transitions. [2019-12-27 06:24:12,444 INFO L78 Accepts]: Start accepts. Automaton has 20429 states and 61164 transitions. Word has length 33 [2019-12-27 06:24:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:12,444 INFO L462 AbstractCegarLoop]: Abstraction has 20429 states and 61164 transitions. [2019-12-27 06:24:12,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 20429 states and 61164 transitions. [2019-12-27 06:24:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:24:12,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:12,461 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 06:24:12,461 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 06:24:12,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 06:24:12,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:12,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578360238] [2019-12-27 06:24:12,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:12,572 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 06:24:12,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578360238] [2019-12-27 06:24:12,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:12,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:12,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151704640] [2019-12-27 06:24:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:12,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:12,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:12,575 INFO L87 Difference]: Start difference. First operand 20429 states and 61164 transitions. Second operand 8 states. [2019-12-27 06:24:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:14,453 INFO L93 Difference]: Finished difference Result 45938 states and 134542 transitions. [2019-12-27 06:24:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:24:14,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 06:24:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:14,517 INFO L225 Difference]: With dead ends: 45938 [2019-12-27 06:24:14,517 INFO L226 Difference]: Without dead ends: 45938 [2019-12-27 06:24:14,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:24:14,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45938 states. [2019-12-27 06:24:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45938 to 19869. [2019-12-27 06:24:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19869 states. [2019-12-27 06:24:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19869 states to 19869 states and 59496 transitions. [2019-12-27 06:24:14,998 INFO L78 Accepts]: Start accepts. Automaton has 19869 states and 59496 transitions. Word has length 33 [2019-12-27 06:24:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:14,998 INFO L462 AbstractCegarLoop]: Abstraction has 19869 states and 59496 transitions. [2019-12-27 06:24:14,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19869 states and 59496 transitions. [2019-12-27 06:24:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:24:15,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:15,015 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] [2019-12-27 06:24:15,015 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 06:24:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 06:24:15,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:15,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814713277] [2019-12-27 06:24:15,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:15,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 06:24:15,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814713277] [2019-12-27 06:24:15,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:15,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:15,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807487071] [2019-12-27 06:24:15,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:15,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:15,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:15,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:15,120 INFO L87 Difference]: Start difference. First operand 19869 states and 59496 transitions. Second operand 7 states. [2019-12-27 06:24:16,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:16,468 INFO L93 Difference]: Finished difference Result 35347 states and 103667 transitions. [2019-12-27 06:24:16,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:24:16,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:24:16,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:16,519 INFO L225 Difference]: With dead ends: 35347 [2019-12-27 06:24:16,519 INFO L226 Difference]: Without dead ends: 35347 [2019-12-27 06:24:16,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:24:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35347 states. [2019-12-27 06:24:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35347 to 18737. [2019-12-27 06:24:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18737 states. [2019-12-27 06:24:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18737 states to 18737 states and 56193 transitions. [2019-12-27 06:24:16,928 INFO L78 Accepts]: Start accepts. Automaton has 18737 states and 56193 transitions. Word has length 34 [2019-12-27 06:24:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:16,928 INFO L462 AbstractCegarLoop]: Abstraction has 18737 states and 56193 transitions. [2019-12-27 06:24:16,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18737 states and 56193 transitions. [2019-12-27 06:24:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:24:16,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:16,945 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] [2019-12-27 06:24:16,946 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 06:24:16,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:16,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 06:24:16,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:16,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918238559] [2019-12-27 06:24:16,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:17,051 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 06:24:17,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918238559] [2019-12-27 06:24:17,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:17,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:17,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230235646] [2019-12-27 06:24:17,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:17,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:17,054 INFO L87 Difference]: Start difference. First operand 18737 states and 56193 transitions. Second operand 8 states. [2019-12-27 06:24:17,265 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 06:24:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:19,104 INFO L93 Difference]: Finished difference Result 40218 states and 116651 transitions. [2019-12-27 06:24:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 06:24:19,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 06:24:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:19,183 INFO L225 Difference]: With dead ends: 40218 [2019-12-27 06:24:19,183 INFO L226 Difference]: Without dead ends: 40218 [2019-12-27 06:24:19,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:24:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40218 states. [2019-12-27 06:24:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40218 to 16942. [2019-12-27 06:24:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16942 states. [2019-12-27 06:24:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16942 states to 16942 states and 50873 transitions. [2019-12-27 06:24:19,593 INFO L78 Accepts]: Start accepts. Automaton has 16942 states and 50873 transitions. Word has length 34 [2019-12-27 06:24:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:19,593 INFO L462 AbstractCegarLoop]: Abstraction has 16942 states and 50873 transitions. [2019-12-27 06:24:19,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 16942 states and 50873 transitions. [2019-12-27 06:24:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:24:19,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:19,615 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 06:24:19,615 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 06:24:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:19,616 INFO L82 PathProgramCache]: Analyzing trace with hash -903409010, now seen corresponding path program 1 times [2019-12-27 06:24:19,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:19,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143067256] [2019-12-27 06:24:19,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:19,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143067256] [2019-12-27 06:24:19,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:19,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:19,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441834911] [2019-12-27 06:24:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:19,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:19,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:19,659 INFO L87 Difference]: Start difference. First operand 16942 states and 50873 transitions. Second operand 3 states. [2019-12-27 06:24:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:19,773 INFO L93 Difference]: Finished difference Result 28674 states and 86440 transitions. [2019-12-27 06:24:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:19,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:24:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:19,804 INFO L225 Difference]: With dead ends: 28674 [2019-12-27 06:24:19,804 INFO L226 Difference]: Without dead ends: 14491 [2019-12-27 06:24:19,805 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 06:24:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14491 states. [2019-12-27 06:24:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14491 to 14411. [2019-12-27 06:24:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14411 states. [2019-12-27 06:24:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14411 states to 14411 states and 42552 transitions. [2019-12-27 06:24:20,180 INFO L78 Accepts]: Start accepts. Automaton has 14411 states and 42552 transitions. Word has length 39 [2019-12-27 06:24:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:20,180 INFO L462 AbstractCegarLoop]: Abstraction has 14411 states and 42552 transitions. [2019-12-27 06:24:20,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 14411 states and 42552 transitions. [2019-12-27 06:24:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:24:20,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:20,198 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 06:24:20,198 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 06:24:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2089566008, now seen corresponding path program 2 times [2019-12-27 06:24:20,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:20,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172634487] [2019-12-27 06:24:20,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:20,244 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 06:24:20,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172634487] [2019-12-27 06:24:20,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:20,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:24:20,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514998870] [2019-12-27 06:24:20,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:20,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:20,246 INFO L87 Difference]: Start difference. First operand 14411 states and 42552 transitions. Second operand 3 states. [2019-12-27 06:24:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:20,308 INFO L93 Difference]: Finished difference Result 14410 states and 42550 transitions. [2019-12-27 06:24:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:20,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:24:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:20,336 INFO L225 Difference]: With dead ends: 14410 [2019-12-27 06:24:20,337 INFO L226 Difference]: Without dead ends: 14410 [2019-12-27 06:24:20,337 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 06:24:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14410 states. [2019-12-27 06:24:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14410 to 14410. [2019-12-27 06:24:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14410 states. [2019-12-27 06:24:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14410 states to 14410 states and 42550 transitions. [2019-12-27 06:24:20,642 INFO L78 Accepts]: Start accepts. Automaton has 14410 states and 42550 transitions. Word has length 39 [2019-12-27 06:24:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:20,643 INFO L462 AbstractCegarLoop]: Abstraction has 14410 states and 42550 transitions. [2019-12-27 06:24:20,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:20,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14410 states and 42550 transitions. [2019-12-27 06:24:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:20,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:20,662 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 06:24:20,662 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 06:24:20,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:20,662 INFO L82 PathProgramCache]: Analyzing trace with hash 860206803, now seen corresponding path program 1 times [2019-12-27 06:24:20,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:20,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495228383] [2019-12-27 06:24:20,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:20,706 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 06:24:20,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495228383] [2019-12-27 06:24:20,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:20,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:20,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506592321] [2019-12-27 06:24:20,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:20,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:20,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:20,712 INFO L87 Difference]: Start difference. First operand 14410 states and 42550 transitions. Second operand 4 states. [2019-12-27 06:24:20,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:20,818 INFO L93 Difference]: Finished difference Result 22992 states and 68333 transitions. [2019-12-27 06:24:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:20,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 06:24:20,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:20,837 INFO L225 Difference]: With dead ends: 22992 [2019-12-27 06:24:20,837 INFO L226 Difference]: Without dead ends: 9673 [2019-12-27 06:24:20,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 06:24:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2019-12-27 06:24:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 9671. [2019-12-27 06:24:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 06:24:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 28400 transitions. [2019-12-27 06:24:21,150 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 28400 transitions. Word has length 40 [2019-12-27 06:24:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:21,150 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 28400 transitions. [2019-12-27 06:24:21,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 28400 transitions. [2019-12-27 06:24:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:21,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:21,161 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 06:24:21,161 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 06:24:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:21,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1423567527, now seen corresponding path program 2 times [2019-12-27 06:24:21,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:21,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59671858] [2019-12-27 06:24:21,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:21,224 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 06:24:21,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59671858] [2019-12-27 06:24:21,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:21,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:21,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139698755] [2019-12-27 06:24:21,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:21,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:21,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:21,226 INFO L87 Difference]: Start difference. First operand 9671 states and 28400 transitions. Second operand 5 states. [2019-12-27 06:24:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:21,973 INFO L93 Difference]: Finished difference Result 16141 states and 47102 transitions. [2019-12-27 06:24:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:24:21,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:24:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:22,009 INFO L225 Difference]: With dead ends: 16141 [2019-12-27 06:24:22,009 INFO L226 Difference]: Without dead ends: 16141 [2019-12-27 06:24:22,010 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 06:24:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16141 states. [2019-12-27 06:24:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16141 to 15212. [2019-12-27 06:24:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15212 states. [2019-12-27 06:24:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15212 states to 15212 states and 44489 transitions. [2019-12-27 06:24:22,466 INFO L78 Accepts]: Start accepts. Automaton has 15212 states and 44489 transitions. Word has length 40 [2019-12-27 06:24:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:22,466 INFO L462 AbstractCegarLoop]: Abstraction has 15212 states and 44489 transitions. [2019-12-27 06:24:22,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 15212 states and 44489 transitions. [2019-12-27 06:24:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:24:22,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:22,486 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 06:24:22,486 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 06:24:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 3 times [2019-12-27 06:24:22,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:22,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362444087] [2019-12-27 06:24:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:22,546 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 06:24:22,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362444087] [2019-12-27 06:24:22,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:22,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:22,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138148596] [2019-12-27 06:24:22,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:22,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:22,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:22,549 INFO L87 Difference]: Start difference. First operand 15212 states and 44489 transitions. Second operand 5 states. [2019-12-27 06:24:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:22,625 INFO L93 Difference]: Finished difference Result 14131 states and 42020 transitions. [2019-12-27 06:24:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:22,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:24:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:22,646 INFO L225 Difference]: With dead ends: 14131 [2019-12-27 06:24:22,647 INFO L226 Difference]: Without dead ends: 12149 [2019-12-27 06:24:22,647 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 06:24:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12149 states. [2019-12-27 06:24:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12149 to 11603. [2019-12-27 06:24:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11603 states. [2019-12-27 06:24:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11603 states to 11603 states and 36079 transitions. [2019-12-27 06:24:22,857 INFO L78 Accepts]: Start accepts. Automaton has 11603 states and 36079 transitions. Word has length 40 [2019-12-27 06:24:22,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:22,858 INFO L462 AbstractCegarLoop]: Abstraction has 11603 states and 36079 transitions. [2019-12-27 06:24:22,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11603 states and 36079 transitions. [2019-12-27 06:24:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:22,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:22,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:24:22,871 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 06:24:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:22,871 INFO L82 PathProgramCache]: Analyzing trace with hash 987827026, now seen corresponding path program 1 times [2019-12-27 06:24:22,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:22,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146003697] [2019-12-27 06:24:22,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:22,976 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 06:24:22,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146003697] [2019-12-27 06:24:22,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:24:22,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502365254] [2019-12-27 06:24:22,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:24:22,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:24:22,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:24:22,978 INFO L87 Difference]: Start difference. First operand 11603 states and 36079 transitions. Second operand 8 states. [2019-12-27 06:24:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:23,810 INFO L93 Difference]: Finished difference Result 31587 states and 96032 transitions. [2019-12-27 06:24:23,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:24:23,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 06:24:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:23,843 INFO L225 Difference]: With dead ends: 31587 [2019-12-27 06:24:23,843 INFO L226 Difference]: Without dead ends: 22364 [2019-12-27 06:24:23,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 06:24:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22364 states. [2019-12-27 06:24:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22364 to 13002. [2019-12-27 06:24:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13002 states. [2019-12-27 06:24:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13002 states to 13002 states and 40208 transitions. [2019-12-27 06:24:24,133 INFO L78 Accepts]: Start accepts. Automaton has 13002 states and 40208 transitions. Word has length 64 [2019-12-27 06:24:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:24,133 INFO L462 AbstractCegarLoop]: Abstraction has 13002 states and 40208 transitions. [2019-12-27 06:24:24,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:24:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13002 states and 40208 transitions. [2019-12-27 06:24:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:24,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:24,146 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 06:24:24,146 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 06:24:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:24,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2017353844, now seen corresponding path program 2 times [2019-12-27 06:24:24,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:24,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042240261] [2019-12-27 06:24:24,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:24,240 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 06:24:24,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042240261] [2019-12-27 06:24:24,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:24,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:24,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439866645] [2019-12-27 06:24:24,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:24,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:24,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:24,243 INFO L87 Difference]: Start difference. First operand 13002 states and 40208 transitions. Second operand 7 states. [2019-12-27 06:24:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:24,662 INFO L93 Difference]: Finished difference Result 25917 states and 78857 transitions. [2019-12-27 06:24:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:24,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:24:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:24,699 INFO L225 Difference]: With dead ends: 25917 [2019-12-27 06:24:24,699 INFO L226 Difference]: Without dead ends: 18327 [2019-12-27 06:24:24,699 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 06:24:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18327 states. [2019-12-27 06:24:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18327 to 15314. [2019-12-27 06:24:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2019-12-27 06:24:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 47034 transitions. [2019-12-27 06:24:25,349 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 47034 transitions. Word has length 64 [2019-12-27 06:24:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:25,349 INFO L462 AbstractCegarLoop]: Abstraction has 15314 states and 47034 transitions. [2019-12-27 06:24:25,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 47034 transitions. [2019-12-27 06:24:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:25,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:25,377 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 06:24:25,377 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 06:24:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -838064708, now seen corresponding path program 3 times [2019-12-27 06:24:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:25,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497718494] [2019-12-27 06:24:25,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:25,516 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 06:24:25,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497718494] [2019-12-27 06:24:25,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:25,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:25,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261420503] [2019-12-27 06:24:25,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:25,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:25,520 INFO L87 Difference]: Start difference. First operand 15314 states and 47034 transitions. Second operand 9 states. [2019-12-27 06:24:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:26,753 INFO L93 Difference]: Finished difference Result 47803 states and 144821 transitions. [2019-12-27 06:24:26,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:24:26,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:24:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:26,833 INFO L225 Difference]: With dead ends: 47803 [2019-12-27 06:24:26,833 INFO L226 Difference]: Without dead ends: 44099 [2019-12-27 06:24:26,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:24:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44099 states. [2019-12-27 06:24:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44099 to 15558. [2019-12-27 06:24:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15558 states. [2019-12-27 06:24:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 47784 transitions. [2019-12-27 06:24:27,281 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 47784 transitions. Word has length 64 [2019-12-27 06:24:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:27,281 INFO L462 AbstractCegarLoop]: Abstraction has 15558 states and 47784 transitions. [2019-12-27 06:24:27,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 47784 transitions. [2019-12-27 06:24:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:27,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:27,296 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 06:24:27,296 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 06:24:27,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1593875220, now seen corresponding path program 4 times [2019-12-27 06:24:27,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:27,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900666927] [2019-12-27 06:24:27,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:27,392 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 06:24:27,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900666927] [2019-12-27 06:24:27,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:27,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:27,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494176321] [2019-12-27 06:24:27,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:27,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:27,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:27,394 INFO L87 Difference]: Start difference. First operand 15558 states and 47784 transitions. Second operand 9 states. [2019-12-27 06:24:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:28,464 INFO L93 Difference]: Finished difference Result 35624 states and 107719 transitions. [2019-12-27 06:24:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:24:28,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:24:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:28,508 INFO L225 Difference]: With dead ends: 35624 [2019-12-27 06:24:28,509 INFO L226 Difference]: Without dead ends: 32808 [2019-12-27 06:24:28,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:24:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32808 states. [2019-12-27 06:24:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32808 to 15311. [2019-12-27 06:24:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 06:24:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 47116 transitions. [2019-12-27 06:24:29,122 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 47116 transitions. Word has length 64 [2019-12-27 06:24:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:29,123 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 47116 transitions. [2019-12-27 06:24:29,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 47116 transitions. [2019-12-27 06:24:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:29,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:29,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:29,138 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 06:24:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:29,138 INFO L82 PathProgramCache]: Analyzing trace with hash -406759870, now seen corresponding path program 5 times [2019-12-27 06:24:29,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:29,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328212551] [2019-12-27 06:24:29,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:29,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 06:24:29,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328212551] [2019-12-27 06:24:29,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:29,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:29,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947736717] [2019-12-27 06:24:29,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:29,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:29,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:29,219 INFO L87 Difference]: Start difference. First operand 15311 states and 47116 transitions. Second operand 7 states. [2019-12-27 06:24:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:29,523 INFO L93 Difference]: Finished difference Result 25740 states and 77714 transitions. [2019-12-27 06:24:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:24:29,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:24:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:29,550 INFO L225 Difference]: With dead ends: 25740 [2019-12-27 06:24:29,550 INFO L226 Difference]: Without dead ends: 18859 [2019-12-27 06:24:29,551 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 06:24:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18859 states. [2019-12-27 06:24:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18859 to 15335. [2019-12-27 06:24:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15335 states. [2019-12-27 06:24:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15335 states to 15335 states and 47162 transitions. [2019-12-27 06:24:29,807 INFO L78 Accepts]: Start accepts. Automaton has 15335 states and 47162 transitions. Word has length 64 [2019-12-27 06:24:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:29,807 INFO L462 AbstractCegarLoop]: Abstraction has 15335 states and 47162 transitions. [2019-12-27 06:24:29,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15335 states and 47162 transitions. [2019-12-27 06:24:29,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:24:29,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:29,822 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 06:24:29,822 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 06:24:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2083011794, now seen corresponding path program 6 times [2019-12-27 06:24:29,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:29,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251687026] [2019-12-27 06:24:29,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:29,880 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 06:24:29,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251687026] [2019-12-27 06:24:29,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:29,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:29,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944716837] [2019-12-27 06:24:29,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:29,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:29,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:29,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:29,882 INFO L87 Difference]: Start difference. First operand 15335 states and 47162 transitions. Second operand 3 states. [2019-12-27 06:24:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:30,008 INFO L93 Difference]: Finished difference Result 17615 states and 54128 transitions. [2019-12-27 06:24:30,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:30,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:24:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:30,040 INFO L225 Difference]: With dead ends: 17615 [2019-12-27 06:24:30,040 INFO L226 Difference]: Without dead ends: 17615 [2019-12-27 06:24:30,040 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 06:24:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17615 states. [2019-12-27 06:24:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17615 to 15395. [2019-12-27 06:24:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15395 states. [2019-12-27 06:24:30,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15395 states to 15395 states and 47626 transitions. [2019-12-27 06:24:30,293 INFO L78 Accepts]: Start accepts. Automaton has 15395 states and 47626 transitions. Word has length 64 [2019-12-27 06:24:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:30,293 INFO L462 AbstractCegarLoop]: Abstraction has 15395 states and 47626 transitions. [2019-12-27 06:24:30,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 15395 states and 47626 transitions. [2019-12-27 06:24:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:30,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:30,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:30,310 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:30,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:30,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2130207003, now seen corresponding path program 1 times [2019-12-27 06:24:30,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:30,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062843616] [2019-12-27 06:24:30,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:30,354 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 06:24:30,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062843616] [2019-12-27 06:24:30,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:30,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:30,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036835986] [2019-12-27 06:24:30,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:30,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:30,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:30,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:30,356 INFO L87 Difference]: Start difference. First operand 15395 states and 47626 transitions. Second operand 4 states. [2019-12-27 06:24:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:30,572 INFO L93 Difference]: Finished difference Result 19567 states and 60167 transitions. [2019-12-27 06:24:30,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:30,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 06:24:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:30,603 INFO L225 Difference]: With dead ends: 19567 [2019-12-27 06:24:30,603 INFO L226 Difference]: Without dead ends: 19567 [2019-12-27 06:24:30,603 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 06:24:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19567 states. [2019-12-27 06:24:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19567 to 15944. [2019-12-27 06:24:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15944 states. [2019-12-27 06:24:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15944 states to 15944 states and 49343 transitions. [2019-12-27 06:24:30,870 INFO L78 Accepts]: Start accepts. Automaton has 15944 states and 49343 transitions. Word has length 65 [2019-12-27 06:24:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:30,871 INFO L462 AbstractCegarLoop]: Abstraction has 15944 states and 49343 transitions. [2019-12-27 06:24:30,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15944 states and 49343 transitions. [2019-12-27 06:24:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:30,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:30,887 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 06:24:30,888 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 06:24:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1591994433, now seen corresponding path program 2 times [2019-12-27 06:24:30,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:30,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980540388] [2019-12-27 06:24:30,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:30,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980540388] [2019-12-27 06:24:30,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:30,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:30,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180852541] [2019-12-27 06:24:30,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:30,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:30,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:30,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:30,994 INFO L87 Difference]: Start difference. First operand 15944 states and 49343 transitions. Second operand 9 states. [2019-12-27 06:24:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:32,054 INFO L93 Difference]: Finished difference Result 41264 states and 124013 transitions. [2019-12-27 06:24:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:24:32,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:24:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:32,100 INFO L225 Difference]: With dead ends: 41264 [2019-12-27 06:24:32,100 INFO L226 Difference]: Without dead ends: 33724 [2019-12-27 06:24:32,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:24:32,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33724 states. [2019-12-27 06:24:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33724 to 15883. [2019-12-27 06:24:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15883 states. [2019-12-27 06:24:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15883 states to 15883 states and 48653 transitions. [2019-12-27 06:24:32,650 INFO L78 Accepts]: Start accepts. Automaton has 15883 states and 48653 transitions. Word has length 65 [2019-12-27 06:24:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:32,651 INFO L462 AbstractCegarLoop]: Abstraction has 15883 states and 48653 transitions. [2019-12-27 06:24:32,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:32,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 48653 transitions. [2019-12-27 06:24:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:32,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:32,667 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 06:24:32,667 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 06:24:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1318305515, now seen corresponding path program 3 times [2019-12-27 06:24:32,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:32,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974969321] [2019-12-27 06:24:32,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:32,764 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 06:24:32,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974969321] [2019-12-27 06:24:32,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:32,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:24:32,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849859020] [2019-12-27 06:24:32,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:24:32,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:24:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:24:32,766 INFO L87 Difference]: Start difference. First operand 15883 states and 48653 transitions. Second operand 9 states. [2019-12-27 06:24:33,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:33,670 INFO L93 Difference]: Finished difference Result 32475 states and 97537 transitions. [2019-12-27 06:24:33,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:24:33,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:24:33,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:33,710 INFO L225 Difference]: With dead ends: 32475 [2019-12-27 06:24:33,710 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 06:24:33,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:24:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 06:24:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 15369. [2019-12-27 06:24:34,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15369 states. [2019-12-27 06:24:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 47106 transitions. [2019-12-27 06:24:34,030 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 47106 transitions. Word has length 65 [2019-12-27 06:24:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:34,030 INFO L462 AbstractCegarLoop]: Abstraction has 15369 states and 47106 transitions. [2019-12-27 06:24:34,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:24:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 47106 transitions. [2019-12-27 06:24:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:24:34,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:34,046 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 06:24:34,047 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 06:24:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2022119832, now seen corresponding path program 1 times [2019-12-27 06:24:34,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:34,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14669116] [2019-12-27 06:24:34,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:34,105 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 06:24:34,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14669116] [2019-12-27 06:24:34,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:34,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:34,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863284960] [2019-12-27 06:24:34,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:34,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:34,107 INFO L87 Difference]: Start difference. First operand 15369 states and 47106 transitions. Second operand 3 states. [2019-12-27 06:24:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:34,168 INFO L93 Difference]: Finished difference Result 15369 states and 47105 transitions. [2019-12-27 06:24:34,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:34,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:24:34,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:34,190 INFO L225 Difference]: With dead ends: 15369 [2019-12-27 06:24:34,190 INFO L226 Difference]: Without dead ends: 15369 [2019-12-27 06:24:34,191 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 06:24:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15369 states. [2019-12-27 06:24:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15369 to 14435. [2019-12-27 06:24:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14435 states. [2019-12-27 06:24:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14435 states to 14435 states and 44555 transitions. [2019-12-27 06:24:34,416 INFO L78 Accepts]: Start accepts. Automaton has 14435 states and 44555 transitions. Word has length 65 [2019-12-27 06:24:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:34,416 INFO L462 AbstractCegarLoop]: Abstraction has 14435 states and 44555 transitions. [2019-12-27 06:24:34,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 14435 states and 44555 transitions. [2019-12-27 06:24:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:24:34,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:34,432 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 06:24:34,432 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 06:24:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -665679131, now seen corresponding path program 1 times [2019-12-27 06:24:34,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:34,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347039539] [2019-12-27 06:24:34,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:24:34,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347039539] [2019-12-27 06:24:34,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:34,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:34,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966179386] [2019-12-27 06:24:34,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:34,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:34,488 INFO L87 Difference]: Start difference. First operand 14435 states and 44555 transitions. Second operand 3 states. [2019-12-27 06:24:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:34,550 INFO L93 Difference]: Finished difference Result 12651 states and 38448 transitions. [2019-12-27 06:24:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:34,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:24:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:34,581 INFO L225 Difference]: With dead ends: 12651 [2019-12-27 06:24:34,582 INFO L226 Difference]: Without dead ends: 12651 [2019-12-27 06:24:34,582 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 06:24:34,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2019-12-27 06:24:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 12398. [2019-12-27 06:24:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-12-27 06:24:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 37729 transitions. [2019-12-27 06:24:34,967 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 37729 transitions. Word has length 66 [2019-12-27 06:24:34,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:34,967 INFO L462 AbstractCegarLoop]: Abstraction has 12398 states and 37729 transitions. [2019-12-27 06:24:34,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 37729 transitions. [2019-12-27 06:24:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:24:34,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:34,992 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 06:24:34,992 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 06:24:34,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 06:24:34,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:34,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253128958] [2019-12-27 06:24:34,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:35,129 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:24:35,130 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:24:35,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a$mem_tmp~0_9) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_23|) |v_ULTIMATE.start_main_~#t1013~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~a~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_23|) 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= 0 v_~y~0_7) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1013~0.base_23|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_23| 1)) (= |v_ULTIMATE.start_main_~#t1013~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_23| 4)) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= v_~x~0_19 0) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_21|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_18|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_23, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_16|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_19, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_15|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_20|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_7, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-27 06:24:35,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-27 06:24:35,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-27 06:24:35,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= 1 ~a$r_buff0_thd1~0_Out-665034571) (= ~a$r_buff0_thd2~0_In-665034571 ~a$r_buff1_thd2~0_Out-665034571) (= ~a$r_buff0_thd1~0_In-665034571 ~a$r_buff1_thd1~0_Out-665034571) (= ~a$r_buff0_thd0~0_In-665034571 ~a$r_buff1_thd0~0_Out-665034571) (= ~a$r_buff1_thd3~0_Out-665034571 ~a$r_buff0_thd3~0_In-665034571) (= 1 ~x~0_Out-665034571) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-665034571))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-665034571, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-665034571, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-665034571, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-665034571, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-665034571} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-665034571, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-665034571, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-665034571, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-665034571, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-665034571, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-665034571, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-665034571, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-665034571, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-665034571, ~x~0=~x~0_Out-665034571} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 06:24:35,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In409026902 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In409026902 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out409026902| |P1Thread1of1ForFork2_#t~ite9_Out409026902|))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In409026902 |P1Thread1of1ForFork2_#t~ite9_Out409026902|) .cse2) (and (or .cse0 .cse1) (= ~a~0_In409026902 |P1Thread1of1ForFork2_#t~ite9_Out409026902|) .cse2))) InVars {~a~0=~a~0_In409026902, ~a$w_buff1~0=~a$w_buff1~0_In409026902, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In409026902, ~a$w_buff1_used~0=~a$w_buff1_used~0_In409026902} OutVars{~a~0=~a~0_In409026902, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out409026902|, ~a$w_buff1~0=~a$w_buff1~0_In409026902, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In409026902, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out409026902|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In409026902} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:24:35,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1178105438 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1178105438| |P2Thread1of1ForFork0_#t~ite20_Out1178105438|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1178105438| ~a$w_buff0~0_In1178105438)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1178105438 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1178105438 256) 0) .cse1) (and (= 0 (mod ~a$r_buff1_thd3~0_In1178105438 256)) .cse1) (= (mod ~a$w_buff0_used~0_In1178105438 256) 0))) (= |P2Thread1of1ForFork0_#t~ite20_Out1178105438| ~a$w_buff0~0_In1178105438) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1178105438| |P2Thread1of1ForFork0_#t~ite21_Out1178105438|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1178105438, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1178105438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1178105438, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1178105438, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178105438, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1178105438|, ~weak$$choice2~0=~weak$$choice2~0_In1178105438} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1178105438|, ~a$w_buff0~0=~a$w_buff0~0_In1178105438, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1178105438, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1178105438, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1178105438, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1178105438|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1178105438, ~weak$$choice2~0=~weak$$choice2~0_In1178105438} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:24:35,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In890243874 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In890243874 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out890243874| ~a$w_buff0_used~0_In890243874) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out890243874| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In890243874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In890243874} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In890243874, ~a$w_buff0_used~0=~a$w_buff0_used~0_In890243874, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out890243874|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:24:35,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-383692564 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-383692564 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-383692564 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-383692564 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-383692564|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-383692564 |P1Thread1of1ForFork2_#t~ite12_Out-383692564|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-383692564, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-383692564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-383692564, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-383692564} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-383692564, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-383692564, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-383692564, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-383692564|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-383692564} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:24:35,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-67243437 256)))) (or (and (not .cse0) (= ~a$w_buff1~0_In-67243437 |P2Thread1of1ForFork0_#t~ite24_Out-67243437|) (= |P2Thread1of1ForFork0_#t~ite23_In-67243437| |P2Thread1of1ForFork0_#t~ite23_Out-67243437|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-67243437 256) 0))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-67243437 256))) (= (mod ~a$w_buff0_used~0_In-67243437 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-67243437 256) 0)))) (= ~a$w_buff1~0_In-67243437 |P2Thread1of1ForFork0_#t~ite23_Out-67243437|) (= |P2Thread1of1ForFork0_#t~ite24_Out-67243437| |P2Thread1of1ForFork0_#t~ite23_Out-67243437|) .cse0))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-67243437, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-67243437|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-67243437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-67243437, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-67243437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-67243437, ~weak$$choice2~0=~weak$$choice2~0_In-67243437} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-67243437, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-67243437|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-67243437|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-67243437, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-67243437, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-67243437, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-67243437, ~weak$$choice2~0=~weak$$choice2~0_In-67243437} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 06:24:35,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In648715380 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out648715380| ~a$w_buff0_used~0_In648715380) (= |P2Thread1of1ForFork0_#t~ite26_In648715380| |P2Thread1of1ForFork0_#t~ite26_Out648715380|)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out648715380| |P2Thread1of1ForFork0_#t~ite26_Out648715380|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In648715380 256)))) (or (= (mod ~a$w_buff0_used~0_In648715380 256) 0) (and (= (mod ~a$w_buff1_used~0_In648715380 256) 0) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In648715380 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out648715380| ~a$w_buff0_used~0_In648715380) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In648715380|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In648715380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In648715380, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In648715380, ~a$w_buff1_used~0=~a$w_buff1_used~0_In648715380, ~weak$$choice2~0=~weak$$choice2~0_In648715380} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out648715380|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out648715380|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In648715380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In648715380, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In648715380, ~a$w_buff1_used~0=~a$w_buff1_used~0_In648715380, ~weak$$choice2~0=~weak$$choice2~0_In648715380} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 06:24:35,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-588693704 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-588693704 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out-588693704| ~a$r_buff0_thd2~0_In-588693704)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-588693704| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-588693704, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-588693704} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-588693704, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-588693704, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-588693704|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:24:35,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1147781208 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1147781208 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1147781208 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1147781208 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1147781208|)) (and (= ~a$r_buff1_thd2~0_In-1147781208 |P1Thread1of1ForFork2_#t~ite14_Out-1147781208|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1147781208, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1147781208, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1147781208, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1147781208} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1147781208, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1147781208, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1147781208, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1147781208, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1147781208|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:24:35,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:24:35,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:24:35,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 06:24:35,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-1503604798 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1503604798 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1503604798| ~a~0_In-1503604798)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1503604798| ~a$w_buff1~0_In-1503604798) (not .cse1) (not .cse0)))) InVars {~a~0=~a~0_In-1503604798, ~a$w_buff1~0=~a$w_buff1~0_In-1503604798, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503604798, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503604798} OutVars{~a~0=~a~0_In-1503604798, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1503604798|, ~a$w_buff1~0=~a$w_buff1~0_In-1503604798, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503604798, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503604798} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:24:35,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:24:35,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1531736552 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1531736552 256) 0))) (or (and (= ~a$w_buff0_used~0_In1531736552 |P2Thread1of1ForFork0_#t~ite40_Out1531736552|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1531736552| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1531736552, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1531736552} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1531736552|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1531736552, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1531736552} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:24:35,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In263918599 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In263918599 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out263918599|) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out263918599| ~a$w_buff0_used~0_In263918599) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In263918599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In263918599} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out263918599|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In263918599, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In263918599} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:24:35,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-266449445 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-266449445 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-266449445 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-266449445 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-266449445| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out-266449445| ~a$w_buff1_used~0_In-266449445) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-266449445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-266449445, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-266449445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-266449445} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-266449445|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-266449445, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-266449445, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-266449445, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-266449445} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:24:35,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-2024639519 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2024639519 256)))) (or (and (= ~a$r_buff0_thd1~0_In-2024639519 ~a$r_buff0_thd1~0_Out-2024639519) (or .cse0 .cse1)) (and (= ~a$r_buff0_thd1~0_Out-2024639519 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2024639519, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2024639519} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-2024639519|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2024639519, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2024639519} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:24:35,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-732280209 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-732280209 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-732280209 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-732280209 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-732280209|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~a$r_buff1_thd1~0_In-732280209 |P0Thread1of1ForFork1_#t~ite8_Out-732280209|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-732280209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-732280209, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-732280209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-732280209} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-732280209|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-732280209, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-732280209, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-732280209, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-732280209} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:24:35,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:24:35,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-538703647 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-538703647 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-538703647 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-538703647 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-538703647| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-538703647| ~a$w_buff1_used~0_In-538703647)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-538703647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-538703647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-538703647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-538703647} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-538703647, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-538703647, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-538703647, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-538703647, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-538703647|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:24:35,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In760834627 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In760834627 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out760834627| ~a$r_buff0_thd3~0_In760834627) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out760834627| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In760834627, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In760834627} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In760834627, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In760834627, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out760834627|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:24:35,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In1659374397 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1659374397 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1659374397 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1659374397 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1659374397 |P2Thread1of1ForFork0_#t~ite43_Out1659374397|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out1659374397| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1659374397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1659374397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1659374397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1659374397} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1659374397|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1659374397, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1659374397, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1659374397, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1659374397} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:24:35,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:24:35,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:24:35,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2115752483 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2115752483 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out2115752483| |ULTIMATE.start_main_#t~ite48_Out2115752483|))) (or (and (or .cse0 .cse1) (= ~a~0_In2115752483 |ULTIMATE.start_main_#t~ite47_Out2115752483|) .cse2) (and (not .cse1) (not .cse0) (= ~a$w_buff1~0_In2115752483 |ULTIMATE.start_main_#t~ite47_Out2115752483|) .cse2))) InVars {~a~0=~a~0_In2115752483, ~a$w_buff1~0=~a$w_buff1~0_In2115752483, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2115752483, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2115752483} OutVars{~a~0=~a~0_In2115752483, ~a$w_buff1~0=~a$w_buff1~0_In2115752483, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2115752483|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2115752483, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2115752483|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2115752483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:24:35,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1446542332 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1446542332 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1446542332| 0)) (and (= ~a$w_buff0_used~0_In-1446542332 |ULTIMATE.start_main_#t~ite49_Out-1446542332|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1446542332, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1446542332} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1446542332, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1446542332|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1446542332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:24:35,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In1309285719 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In1309285719 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1309285719 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1309285719 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1309285719|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In1309285719 |ULTIMATE.start_main_#t~ite50_Out1309285719|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1309285719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1309285719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1309285719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1309285719} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1309285719|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1309285719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1309285719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1309285719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1309285719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:24:35,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In727540533 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In727540533 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out727540533| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out727540533| ~a$r_buff0_thd0~0_In727540533) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In727540533, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In727540533} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out727540533|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In727540533, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In727540533} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:24:35,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1428313746 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-1428313746 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1428313746 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1428313746 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1428313746| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out-1428313746| ~a$r_buff1_thd0~0_In-1428313746) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1428313746, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428313746, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1428313746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1428313746} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1428313746|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1428313746, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1428313746, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1428313746, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1428313746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:24:35,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~x~0_13 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:24:35,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:24:35 BasicIcfg [2019-12-27 06:24:35,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:24:35,256 INFO L168 Benchmark]: Toolchain (without parser) took 91746.59 ms. Allocated memory was 146.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 103.2 MB in the beginning and 877.5 MB in the end (delta: -774.4 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,257 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.16 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 155.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,261 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,262 INFO L168 Benchmark]: RCFGBuilder took 846.22 ms. Allocated memory is still 203.9 MB. Free memory was 150.5 MB in the beginning and 100.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,262 INFO L168 Benchmark]: TraceAbstraction took 89922.39 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.7 MB in the beginning and 877.5 MB in the end (delta: -777.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:24:35,268 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.19 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 868.16 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 155.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.75 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.22 ms. Allocated memory is still 203.9 MB. Free memory was 150.5 MB in the beginning and 100.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89922.39 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 99.7 MB in the beginning and 877.5 MB in the end (delta: -777.8 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6717 SDtfs, 9639 SDslu, 16328 SDs, 0 SdLazy, 9655 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred 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: 36.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 282172 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 205983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...