/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/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:49:23,298 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:49:23,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:49:23,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:49:23,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:49:23,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:49:23,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:49:23,341 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:49:23,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:49:23,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:49:23,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:49:23,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:49:23,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:49:23,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:49:23,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:49:23,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:49:23,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:49:23,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:49:23,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:49:23,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:49:23,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:49:23,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:49:23,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:49:23,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:49:23,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:49:23,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:49:23,379 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:49:23,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:49:23,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:49:23,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:49:23,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:49:23,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:49:23,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:49:23,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:49:23,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:49:23,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:49:23,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:49:23,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:49:23,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:49:23,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:49:23,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:49:23,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:49:23,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:49:23,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:49:23,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:49:23,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:49:23,421 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:49:23,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:49:23,421 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:49:23,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:49:23,422 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:49:23,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:49:23,422 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:49:23,422 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:49:23,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:49:23,423 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:49:23,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:49:23,423 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:49:23,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:49:23,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:49:23,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:49:23,424 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:49:23,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:49:23,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:49:23,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:49:23,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:49:23,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:49:23,425 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:49:23,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:49:23,425 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:49:23,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:49:23,426 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:49:23,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:49:23,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:49:23,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:49:23,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:49:23,730 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:49:23,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2019-12-18 21:49:23,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0f7fe48/9e10288798bf4d22953e1d041e39d144/FLAG015402eb7 [2019-12-18 21:49:24,335 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:49:24,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2019-12-18 21:49:24,353 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0f7fe48/9e10288798bf4d22953e1d041e39d144/FLAG015402eb7 [2019-12-18 21:49:24,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd0f7fe48/9e10288798bf4d22953e1d041e39d144 [2019-12-18 21:49:24,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:49:24,619 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:49:24,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:24,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:49:24,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:49:24,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:24" (1/1) ... [2019-12-18 21:49:24,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f27377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:24, skipping insertion in model container [2019-12-18 21:49:24,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:49:24" (1/1) ... [2019-12-18 21:49:24,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:49:24,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:49:25,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:25,374 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:49:25,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:49:25,519 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:49:25,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25 WrapperNode [2019-12-18 21:49:25,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:49:25,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:25,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:49:25,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:49:25,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:49:25,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:49:25,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:49:25,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:49:25,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... [2019-12-18 21:49:25,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:49:25,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:49:25,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:49:25,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:49:25,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:49:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:49:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:49:25,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:49:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:49:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:49:25,709 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:49:25,709 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:49:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:49:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:49:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:49:25,710 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:49:25,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:49:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:49:25,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:49:25,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:49:25,713 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:49:26,508 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:49:26,509 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:49:26,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:26 BoogieIcfgContainer [2019-12-18 21:49:26,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:49:26,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:49:26,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:49:26,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:49:26,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:49:24" (1/3) ... [2019-12-18 21:49:26,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398b3173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:26, skipping insertion in model container [2019-12-18 21:49:26,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:49:25" (2/3) ... [2019-12-18 21:49:26,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398b3173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:49:26, skipping insertion in model container [2019-12-18 21:49:26,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:49:26" (3/3) ... [2019-12-18 21:49:26,522 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2019-12-18 21:49:26,534 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:49:26,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:49:26,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:49:26,547 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:49:26,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,600 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,600 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,600 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,601 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,601 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,620 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,620 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,620 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,621 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,622 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,623 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,624 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,629 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,639 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,639 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,641 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:49:26,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:49:26,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:49:26,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:49:26,676 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:49:26,676 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:49:26,676 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:49:26,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:49:26,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:49:26,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:49:26,694 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 21:49:26,696 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:49:26,778 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:49:26,778 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:26,793 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:49:26,814 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 21:49:26,864 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 21:49:26,865 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:49:26,876 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:49:26,892 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:49:26,893 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:49:30,414 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:49:30,551 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:49:30,574 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-18 21:49:30,574 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 21:49:30,577 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-18 21:49:32,694 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:49:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:49:32,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:49:32,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:32,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:32,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:32,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-18 21:49:32,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:32,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195736015] [2019-12-18 21:49:32,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:33,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195736015] [2019-12-18 21:49:33,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:33,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:49:33,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592908132] [2019-12-18 21:49:33,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:33,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:33,550 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:49:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:34,242 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-18 21:49:34,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:34,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:49:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:34,596 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 21:49:34,596 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 21:49:34,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 21:49:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 21:49:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 21:49:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-18 21:49:36,470 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-18 21:49:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:36,470 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-18 21:49:36,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-18 21:49:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:49:36,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:36,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:36,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-18 21:49:36,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:36,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437774163] [2019-12-18 21:49:36,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:36,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437774163] [2019-12-18 21:49:36,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:36,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:36,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836485181] [2019-12-18 21:49:36,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:36,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:36,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:36,609 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 4 states. [2019-12-18 21:49:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:38,466 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-18 21:49:38,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:38,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:49:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:38,746 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 21:49:38,746 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 21:49:38,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:39,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 21:49:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-18 21:49:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-18 21:49:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-18 21:49:41,051 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-18 21:49:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:41,051 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-18 21:49:41,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-18 21:49:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:49:41,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:41,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:41,054 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-18 21:49:41,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:41,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798464015] [2019-12-18 21:49:41,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:41,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798464015] [2019-12-18 21:49:41,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:41,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:41,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901045376] [2019-12-18 21:49:41,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:41,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:41,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:41,190 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-18 21:49:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:43,605 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-18 21:49:43,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:43,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:49:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:44,022 INFO L225 Difference]: With dead ends: 57862 [2019-12-18 21:49:44,022 INFO L226 Difference]: Without dead ends: 57862 [2019-12-18 21:49:44,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-18 21:49:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-18 21:49:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-18 21:49:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-18 21:49:45,908 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-18 21:49:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:45,908 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-18 21:49:45,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-18 21:49:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:49:45,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:45,924 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] [2019-12-18 21:49:45,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-18 21:49:45,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:45,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341523302] [2019-12-18 21:49:45,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341523302] [2019-12-18 21:49:46,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:46,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:46,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807486720] [2019-12-18 21:49:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:49:46,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:46,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:49:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:49:46,033 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 4 states. [2019-12-18 21:49:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:46,230 INFO L93 Difference]: Finished difference Result 41440 states and 157219 transitions. [2019-12-18 21:49:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:49:46,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 21:49:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:46,336 INFO L225 Difference]: With dead ends: 41440 [2019-12-18 21:49:46,336 INFO L226 Difference]: Without dead ends: 40332 [2019-12-18 21:49:46,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40332 states. [2019-12-18 21:49:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40332 to 40332. [2019-12-18 21:49:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-18 21:49:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-18 21:49:49,143 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-18 21:49:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:49,143 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-18 21:49:49,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:49:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-18 21:49:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 21:49:49,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:49,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:49,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:49,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-18 21:49:49,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:49,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511686467] [2019-12-18 21:49:49,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:49,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511686467] [2019-12-18 21:49:49,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:49,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:49,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290347508] [2019-12-18 21:49:49,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:49,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:49,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:49,263 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 5 states. [2019-12-18 21:49:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:49,933 INFO L93 Difference]: Finished difference Result 53868 states and 201666 transitions. [2019-12-18 21:49:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:49:49,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 21:49:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:50,481 INFO L225 Difference]: With dead ends: 53868 [2019-12-18 21:49:50,481 INFO L226 Difference]: Without dead ends: 53847 [2019-12-18 21:49:50,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:49:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53847 states. [2019-12-18 21:49:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53847 to 40578. [2019-12-18 21:49:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40578 states. [2019-12-18 21:49:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40578 states to 40578 states and 154375 transitions. [2019-12-18 21:49:53,927 INFO L78 Accepts]: Start accepts. Automaton has 40578 states and 154375 transitions. Word has length 22 [2019-12-18 21:49:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:53,928 INFO L462 AbstractCegarLoop]: Abstraction has 40578 states and 154375 transitions. [2019-12-18 21:49:53,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40578 states and 154375 transitions. [2019-12-18 21:49:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:49:53,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:53,958 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] [2019-12-18 21:49:53,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-18 21:49:53,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:53,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350490882] [2019-12-18 21:49:53,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:54,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350490882] [2019-12-18 21:49:54,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:54,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:49:54,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577669052] [2019-12-18 21:49:54,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:54,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:54,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:54,032 INFO L87 Difference]: Start difference. First operand 40578 states and 154375 transitions. Second operand 3 states. [2019-12-18 21:49:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:54,286 INFO L93 Difference]: Finished difference Result 51158 states and 192741 transitions. [2019-12-18 21:49:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:54,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 21:49:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:54,397 INFO L225 Difference]: With dead ends: 51158 [2019-12-18 21:49:54,397 INFO L226 Difference]: Without dead ends: 51158 [2019-12-18 21:49:54,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51158 states. [2019-12-18 21:49:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51158 to 44232. [2019-12-18 21:49:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44232 states. [2019-12-18 21:49:55,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44232 states to 44232 states and 167871 transitions. [2019-12-18 21:49:55,483 INFO L78 Accepts]: Start accepts. Automaton has 44232 states and 167871 transitions. Word has length 30 [2019-12-18 21:49:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:55,483 INFO L462 AbstractCegarLoop]: Abstraction has 44232 states and 167871 transitions. [2019-12-18 21:49:55,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 44232 states and 167871 transitions. [2019-12-18 21:49:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 21:49:55,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:55,510 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] [2019-12-18 21:49:55,511 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-18 21:49:55,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:55,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761467670] [2019-12-18 21:49:55,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:55,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761467670] [2019-12-18 21:49:55,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:55,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:49:55,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675356213] [2019-12-18 21:49:55,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:55,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:55,626 INFO L87 Difference]: Start difference. First operand 44232 states and 167871 transitions. Second operand 5 states. [2019-12-18 21:49:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:55,734 INFO L93 Difference]: Finished difference Result 19345 states and 60752 transitions. [2019-12-18 21:49:55,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:49:55,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 21:49:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:55,761 INFO L225 Difference]: With dead ends: 19345 [2019-12-18 21:49:55,761 INFO L226 Difference]: Without dead ends: 18469 [2019-12-18 21:49:55,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18469 states. [2019-12-18 21:49:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18469 to 18469. [2019-12-18 21:49:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-12-18 21:49:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 57954 transitions. [2019-12-18 21:49:56,035 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 57954 transitions. Word has length 30 [2019-12-18 21:49:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:56,035 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 57954 transitions. [2019-12-18 21:49:56,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 57954 transitions. [2019-12-18 21:49:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 21:49:56,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:56,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] [2019-12-18 21:49:56,046 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-18 21:49:56,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:56,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122393975] [2019-12-18 21:49:56,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:56,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:56,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122393975] [2019-12-18 21:49:56,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:56,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:56,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689284846] [2019-12-18 21:49:56,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:49:56,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:49:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:49:56,125 INFO L87 Difference]: Start difference. First operand 18469 states and 57954 transitions. Second operand 6 states. [2019-12-18 21:49:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:56,219 INFO L93 Difference]: Finished difference Result 3432 states and 8687 transitions. [2019-12-18 21:49:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:49:56,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 21:49:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:56,227 INFO L225 Difference]: With dead ends: 3432 [2019-12-18 21:49:56,227 INFO L226 Difference]: Without dead ends: 3063 [2019-12-18 21:49:56,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:49:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2019-12-18 21:49:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2019-12-18 21:49:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3063 states. [2019-12-18 21:49:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 7649 transitions. [2019-12-18 21:49:56,272 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 7649 transitions. Word has length 31 [2019-12-18 21:49:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:56,272 INFO L462 AbstractCegarLoop]: Abstraction has 3063 states and 7649 transitions. [2019-12-18 21:49:56,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:49:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 7649 transitions. [2019-12-18 21:49:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 21:49:56,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:56,277 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] [2019-12-18 21:49:56,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:56,278 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-18 21:49:56,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:56,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378085030] [2019-12-18 21:49:56,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:56,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378085030] [2019-12-18 21:49:56,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:56,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:56,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896439350] [2019-12-18 21:49:56,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:56,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:56,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:56,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:56,374 INFO L87 Difference]: Start difference. First operand 3063 states and 7649 transitions. Second operand 7 states. [2019-12-18 21:49:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:56,478 INFO L93 Difference]: Finished difference Result 1341 states and 3748 transitions. [2019-12-18 21:49:56,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:49:56,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 21:49:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:56,480 INFO L225 Difference]: With dead ends: 1341 [2019-12-18 21:49:56,481 INFO L226 Difference]: Without dead ends: 1292 [2019-12-18 21:49:56,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:49:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2019-12-18 21:49:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1180. [2019-12-18 21:49:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1180 states. [2019-12-18 21:49:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 3332 transitions. [2019-12-18 21:49:56,497 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 3332 transitions. Word has length 43 [2019-12-18 21:49:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:56,498 INFO L462 AbstractCegarLoop]: Abstraction has 1180 states and 3332 transitions. [2019-12-18 21:49:56,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 3332 transitions. [2019-12-18 21:49:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:49:56,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:56,500 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] [2019-12-18 21:49:56,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-18 21:49:56,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:56,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741169080] [2019-12-18 21:49:56,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:56,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741169080] [2019-12-18 21:49:56,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:56,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:49:56,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561311686] [2019-12-18 21:49:56,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:56,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:56,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:56,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:56,638 INFO L87 Difference]: Start difference. First operand 1180 states and 3332 transitions. Second operand 7 states. [2019-12-18 21:49:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:57,124 INFO L93 Difference]: Finished difference Result 1646 states and 4530 transitions. [2019-12-18 21:49:57,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:49:57,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 21:49:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:57,128 INFO L225 Difference]: With dead ends: 1646 [2019-12-18 21:49:57,128 INFO L226 Difference]: Without dead ends: 1646 [2019-12-18 21:49:57,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:49:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-12-18 21:49:57,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1509. [2019-12-18 21:49:57,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-12-18 21:49:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 4178 transitions. [2019-12-18 21:49:57,151 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 4178 transitions. Word has length 58 [2019-12-18 21:49:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:57,152 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 4178 transitions. [2019-12-18 21:49:57,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 4178 transitions. [2019-12-18 21:49:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:49:57,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:57,156 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] [2019-12-18 21:49:57,156 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2143304257, now seen corresponding path program 2 times [2019-12-18 21:49:57,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:57,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182857140] [2019-12-18 21:49:57,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:57,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182857140] [2019-12-18 21:49:57,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:57,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:57,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680186181] [2019-12-18 21:49:57,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:49:57,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:49:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:49:57,258 INFO L87 Difference]: Start difference. First operand 1509 states and 4178 transitions. Second operand 5 states. [2019-12-18 21:49:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:57,477 INFO L93 Difference]: Finished difference Result 1998 states and 5544 transitions. [2019-12-18 21:49:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:49:57,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 21:49:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:57,481 INFO L225 Difference]: With dead ends: 1998 [2019-12-18 21:49:57,481 INFO L226 Difference]: Without dead ends: 1998 [2019-12-18 21:49:57,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-12-18 21:49:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1605. [2019-12-18 21:49:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-12-18 21:49:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 4458 transitions. [2019-12-18 21:49:57,516 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 4458 transitions. Word has length 58 [2019-12-18 21:49:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:57,516 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 4458 transitions. [2019-12-18 21:49:57,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:49:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 4458 transitions. [2019-12-18 21:49:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 21:49:57,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:57,521 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] [2019-12-18 21:49:57,522 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1535525935, now seen corresponding path program 3 times [2019-12-18 21:49:57,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:57,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097161706] [2019-12-18 21:49:57,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:57,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097161706] [2019-12-18 21:49:57,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:57,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:57,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138300425] [2019-12-18 21:49:57,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:57,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:57,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:57,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:57,620 INFO L87 Difference]: Start difference. First operand 1605 states and 4458 transitions. Second operand 3 states. [2019-12-18 21:49:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:57,639 INFO L93 Difference]: Finished difference Result 1465 states and 4030 transitions. [2019-12-18 21:49:57,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:57,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 21:49:57,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:57,642 INFO L225 Difference]: With dead ends: 1465 [2019-12-18 21:49:57,642 INFO L226 Difference]: Without dead ends: 1465 [2019-12-18 21:49:57,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2019-12-18 21:49:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2019-12-18 21:49:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-12-18 21:49:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 4030 transitions. [2019-12-18 21:49:57,665 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 4030 transitions. Word has length 58 [2019-12-18 21:49:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:57,665 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 4030 transitions. [2019-12-18 21:49:57,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 4030 transitions. [2019-12-18 21:49:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:49:57,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:57,669 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:49:57,669 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 900965748, now seen corresponding path program 1 times [2019-12-18 21:49:57,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:57,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876894041] [2019-12-18 21:49:57,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:57,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876894041] [2019-12-18 21:49:57,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:57,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:49:57,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214037018] [2019-12-18 21:49:57,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:49:57,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:49:57,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:57,744 INFO L87 Difference]: Start difference. First operand 1465 states and 4030 transitions. Second operand 3 states. [2019-12-18 21:49:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:57,787 INFO L93 Difference]: Finished difference Result 1464 states and 4028 transitions. [2019-12-18 21:49:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:49:57,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:49:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:57,790 INFO L225 Difference]: With dead ends: 1464 [2019-12-18 21:49:57,791 INFO L226 Difference]: Without dead ends: 1464 [2019-12-18 21:49:57,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:49:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-12-18 21:49:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1159. [2019-12-18 21:49:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-12-18 21:49:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 3186 transitions. [2019-12-18 21:49:57,818 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 3186 transitions. Word has length 59 [2019-12-18 21:49:57,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:57,818 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 3186 transitions. [2019-12-18 21:49:57,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:49:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 3186 transitions. [2019-12-18 21:49:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:49:57,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:57,823 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] [2019-12-18 21:49:57,823 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:57,824 INFO L82 PathProgramCache]: Analyzing trace with hash 319016150, now seen corresponding path program 1 times [2019-12-18 21:49:57,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:57,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122265357] [2019-12-18 21:49:57,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:58,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122265357] [2019-12-18 21:49:58,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:58,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:49:58,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654634349] [2019-12-18 21:49:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:49:58,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:49:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:49:58,180 INFO L87 Difference]: Start difference. First operand 1159 states and 3186 transitions. Second operand 12 states. [2019-12-18 21:49:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:58,855 INFO L93 Difference]: Finished difference Result 2520 states and 6210 transitions. [2019-12-18 21:49:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:49:58,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 21:49:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:58,859 INFO L225 Difference]: With dead ends: 2520 [2019-12-18 21:49:58,859 INFO L226 Difference]: Without dead ends: 1479 [2019-12-18 21:49:58,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:49:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2019-12-18 21:49:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1019. [2019-12-18 21:49:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-18 21:49:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2715 transitions. [2019-12-18 21:49:58,873 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2715 transitions. Word has length 60 [2019-12-18 21:49:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:58,873 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2715 transitions. [2019-12-18 21:49:58,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:49:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2715 transitions. [2019-12-18 21:49:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:49:58,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:58,875 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] [2019-12-18 21:49:58,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:58,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 2 times [2019-12-18 21:49:58,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:58,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418871703] [2019-12-18 21:49:58,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:59,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418871703] [2019-12-18 21:49:59,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:59,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:49:59,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322638577] [2019-12-18 21:49:59,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:49:59,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:49:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:49:59,018 INFO L87 Difference]: Start difference. First operand 1019 states and 2715 transitions. Second operand 7 states. [2019-12-18 21:49:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:59,133 INFO L93 Difference]: Finished difference Result 1958 states and 4862 transitions. [2019-12-18 21:49:59,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:49:59,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 21:49:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:59,134 INFO L225 Difference]: With dead ends: 1958 [2019-12-18 21:49:59,134 INFO L226 Difference]: Without dead ends: 795 [2019-12-18 21:49:59,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:49:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-18 21:49:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 570. [2019-12-18 21:49:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-18 21:49:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1221 transitions. [2019-12-18 21:49:59,143 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1221 transitions. Word has length 60 [2019-12-18 21:49:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:59,143 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1221 transitions. [2019-12-18 21:49:59,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:49:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1221 transitions. [2019-12-18 21:49:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:49:59,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:59,144 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] [2019-12-18 21:49:59,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 3 times [2019-12-18 21:49:59,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:59,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385786942] [2019-12-18 21:49:59,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:59,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385786942] [2019-12-18 21:49:59,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:59,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:49:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842085921] [2019-12-18 21:49:59,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:49:59,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:49:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:49:59,272 INFO L87 Difference]: Start difference. First operand 570 states and 1221 transitions. Second operand 6 states. [2019-12-18 21:49:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:49:59,340 INFO L93 Difference]: Finished difference Result 807 states and 1666 transitions. [2019-12-18 21:49:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:49:59,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 21:49:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:49:59,341 INFO L225 Difference]: With dead ends: 807 [2019-12-18 21:49:59,341 INFO L226 Difference]: Without dead ends: 238 [2019-12-18 21:49:59,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:49:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-12-18 21:49:59,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 214. [2019-12-18 21:49:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-18 21:49:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-18 21:49:59,345 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 60 [2019-12-18 21:49:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:49:59,345 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-18 21:49:59,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:49:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-18 21:49:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:49:59,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:49:59,346 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] [2019-12-18 21:49:59,347 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:49:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:49:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 4 times [2019-12-18 21:49:59,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:49:59,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397853296] [2019-12-18 21:49:59,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:49:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:49:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:49:59,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397853296] [2019-12-18 21:49:59,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:49:59,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:49:59,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408059597] [2019-12-18 21:49:59,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:49:59,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:49:59,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:49:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:49:59,643 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 13 states. [2019-12-18 21:50:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:50:00,009 INFO L93 Difference]: Finished difference Result 364 states and 605 transitions. [2019-12-18 21:50:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 21:50:00,010 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:50:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:50:00,010 INFO L225 Difference]: With dead ends: 364 [2019-12-18 21:50:00,011 INFO L226 Difference]: Without dead ends: 332 [2019-12-18 21:50:00,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 21:50:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-18 21:50:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2019-12-18 21:50:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-18 21:50:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-18 21:50:00,014 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-18 21:50:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:50:00,014 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-18 21:50:00,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:50:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-18 21:50:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:50:00,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:50:00,016 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] [2019-12-18 21:50:00,016 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:50:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:50:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 5 times [2019-12-18 21:50:00,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:50:00,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396237958] [2019-12-18 21:50:00,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:50:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:50:00,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:50:00,178 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:50:00,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1461~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1461~0.base_22|) |v_ULTIMATE.start_main_~#t1461~0.offset_17| 0)) |v_#memory_int_27|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t1461~0.offset_17| 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t1461~0.base_22| 4) |v_#length_31|) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1461~0.base_22|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1461~0.base_22| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1461~0.base_22|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1464~0.base=|v_ULTIMATE.start_main_~#t1464~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_~#t1461~0.base=|v_ULTIMATE.start_main_~#t1461~0.base_22|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_~#t1463~0.offset=|v_ULTIMATE.start_main_~#t1463~0.offset_17|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ULTIMATE.start_main_~#t1464~0.offset=|v_ULTIMATE.start_main_~#t1464~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ULTIMATE.start_main_~#t1462~0.base=|v_ULTIMATE.start_main_~#t1462~0.base_23|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1462~0.offset=|v_ULTIMATE.start_main_~#t1462~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1463~0.base=|v_ULTIMATE.start_main_~#t1463~0.base_20|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9, ULTIMATE.start_main_~#t1461~0.offset=|v_ULTIMATE.start_main_~#t1461~0.offset_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1464~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1461~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1463~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ULTIMATE.start_main_~#t1464~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1462~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1462~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1463~0.base, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1461~0.offset] because there is no mapped edge [2019-12-18 21:50:00,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1462~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1462~0.base_13|) |v_ULTIMATE.start_main_~#t1462~0.offset_11| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1462~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1462~0.base_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1462~0.base_13|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1462~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1462~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t1462~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1462~0.base=|v_ULTIMATE.start_main_~#t1462~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1462~0.offset=|v_ULTIMATE.start_main_~#t1462~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1462~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1462~0.offset] because there is no mapped edge [2019-12-18 21:50:00,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= |v_ULTIMATE.start_main_~#t1463~0.offset_10| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1463~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1463~0.base_10|) |v_ULTIMATE.start_main_~#t1463~0.offset_10| 2)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1463~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1463~0.base_10| 0)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1463~0.base_10| 4) |v_#length_19|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1463~0.base_10|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1463~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1463~0.base=|v_ULTIMATE.start_main_~#t1463~0.base_10|, ULTIMATE.start_main_~#t1463~0.offset=|v_ULTIMATE.start_main_~#t1463~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_19|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1463~0.base, ULTIMATE.start_main_~#t1463~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:50:00,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1464~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1464~0.base_11|) |v_ULTIMATE.start_main_~#t1464~0.offset_10| 3)) |v_#memory_int_17|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1464~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1464~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1464~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1464~0.base_11|)) (= |v_ULTIMATE.start_main_~#t1464~0.offset_10| 0) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1464~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1464~0.base=|v_ULTIMATE.start_main_~#t1464~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1464~0.offset=|v_ULTIMATE.start_main_~#t1464~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1464~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1464~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:50:00,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1373392349)) (= 1 ~z$r_buff0_thd4~0_Out1373392349) (= ~z$r_buff1_thd4~0_Out1373392349 ~z$r_buff0_thd4~0_In1373392349) (= ~__unbuffered_p3_EAX~0_Out1373392349 ~a~0_In1373392349) (= ~z$r_buff0_thd1~0_In1373392349 ~z$r_buff1_thd1~0_Out1373392349) (= ~z$r_buff1_thd3~0_Out1373392349 ~z$r_buff0_thd3~0_In1373392349) (= ~z$r_buff0_thd2~0_In1373392349 ~z$r_buff1_thd2~0_Out1373392349) (= ~z$r_buff1_thd0~0_Out1373392349 ~z$r_buff0_thd0~0_In1373392349)) InVars {~a~0=~a~0_In1373392349, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1373392349, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1373392349, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1373392349, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1373392349, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1373392349, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1373392349} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1373392349, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1373392349, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1373392349, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1373392349, ~a~0=~a~0_In1373392349, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1373392349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1373392349, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1373392349, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1373392349, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1373392349, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1373392349, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1373392349, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1373392349} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:50:00,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:50:00,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:50:00,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1093958434 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1093958434 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1093958434|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In1093958434 |P3Thread1of1ForFork3_#t~ite11_Out1093958434|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1093958434, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1093958434} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1093958434, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1093958434, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1093958434|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:50:00,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1609052978 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1609052978 256)))) (or (and (= ~z~0_In-1609052978 |P2Thread1of1ForFork2_#t~ite3_Out-1609052978|) (or .cse0 .cse1)) (and (not .cse0) (= ~z$w_buff1~0_In-1609052978 |P2Thread1of1ForFork2_#t~ite3_Out-1609052978|) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1609052978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1609052978, ~z$w_buff1~0=~z$w_buff1~0_In-1609052978, ~z~0=~z~0_In-1609052978} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1609052978|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1609052978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1609052978, ~z$w_buff1~0=~z$w_buff1~0_In-1609052978, ~z~0=~z~0_In-1609052978} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:50:00,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:50:00,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In1217779918 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1217779918 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1217779918 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1217779918 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite12_Out1217779918| ~z$w_buff1_used~0_In1217779918) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork3_#t~ite12_Out1217779918| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1217779918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1217779918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1217779918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1217779918} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1217779918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1217779918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1217779918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1217779918, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1217779918|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:50:00,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-291063913 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-291063913 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-291063913 ~z$r_buff0_thd4~0_In-291063913)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-291063913) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-291063913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-291063913} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-291063913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-291063913, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-291063913|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:50:00,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-692660956 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-692660956 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-692660956 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-692660956 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out-692660956| ~z$r_buff1_thd4~0_In-692660956) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork3_#t~ite14_Out-692660956| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-692660956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-692660956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-692660956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-692660956} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-692660956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-692660956, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-692660956|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-692660956, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-692660956} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:50:00,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:50:00,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1034190548 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1034190548 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-1034190548| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-1034190548| ~z$w_buff0_used~0_In-1034190548)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1034190548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1034190548} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1034190548|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1034190548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1034190548} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:50:00,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-730196869 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-730196869 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-730196869 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-730196869 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-730196869 |P2Thread1of1ForFork2_#t~ite6_Out-730196869|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-730196869|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-730196869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-730196869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730196869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-730196869} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-730196869|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-730196869, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-730196869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-730196869, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-730196869} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:50:00,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1245770061 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1245770061 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1245770061| ~z$r_buff0_thd3~0_In1245770061)) (and (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1245770061|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1245770061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1245770061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1245770061, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1245770061, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1245770061|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:50:00,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In240550936 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In240550936 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In240550936 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In240550936 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out240550936|)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In240550936 |P2Thread1of1ForFork2_#t~ite8_Out240550936|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In240550936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In240550936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240550936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In240550936} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In240550936, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In240550936, ~z$w_buff1_used~0=~z$w_buff1_used~0_In240550936, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In240550936, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out240550936|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:50:00,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:50:00,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:50:00,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1667876378 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1667876378 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1667876378| ~z$w_buff1~0_In1667876378) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite19_Out1667876378| ~z~0_In1667876378) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1667876378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1667876378, ~z$w_buff1~0=~z$w_buff1~0_In1667876378, ~z~0=~z~0_In1667876378} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1667876378|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1667876378, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1667876378, ~z$w_buff1~0=~z$w_buff1~0_In1667876378, ~z~0=~z~0_In1667876378} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:50:00,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:50:00,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-110369959 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-110369959 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-110369959| ~z$w_buff0_used~0_In-110369959) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-110369959|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-110369959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-110369959} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-110369959, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-110369959, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-110369959|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:50:00,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-251285751 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-251285751 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-251285751 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-251285751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-251285751|)) (and (= ~z$w_buff1_used~0_In-251285751 |ULTIMATE.start_main_#t~ite22_Out-251285751|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-251285751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-251285751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-251285751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-251285751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-251285751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-251285751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-251285751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-251285751, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-251285751|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:50:00,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1589932794 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1589932794 256)))) (or (and (= ~z$r_buff0_thd0~0_In-1589932794 |ULTIMATE.start_main_#t~ite23_Out-1589932794|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-1589932794| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1589932794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589932794} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1589932794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1589932794, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1589932794|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:50:00,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1833612883 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1833612883 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1833612883 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1833612883 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1833612883| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out1833612883| ~z$r_buff1_thd0~0_In1833612883) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1833612883, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1833612883, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1833612883, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1833612883} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1833612883, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1833612883, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1833612883, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1833612883|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1833612883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:50:00,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In825281851 256)))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out825281851| ~z$w_buff1~0_In825281851) (= |ULTIMATE.start_main_#t~ite33_In825281851| |ULTIMATE.start_main_#t~ite33_Out825281851|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite34_Out825281851| |ULTIMATE.start_main_#t~ite33_Out825281851|) (= |ULTIMATE.start_main_#t~ite33_Out825281851| ~z$w_buff1~0_In825281851) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In825281851 256) 0))) (or (and (= (mod ~z$r_buff1_thd0~0_In825281851 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In825281851 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In825281851 256) 0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In825281851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In825281851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In825281851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In825281851, ~z$w_buff1~0=~z$w_buff1~0_In825281851, ~weak$$choice2~0=~weak$$choice2~0_In825281851, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In825281851|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In825281851, ~z$w_buff0_used~0=~z$w_buff0_used~0_In825281851, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In825281851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In825281851, ~z$w_buff1~0=~z$w_buff1~0_In825281851, ~weak$$choice2~0=~weak$$choice2~0_In825281851, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out825281851|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out825281851|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 21:50:00,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In532364547 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out532364547| |ULTIMATE.start_main_#t~ite39_Out532364547|) .cse0 (= ~z$w_buff1_used~0_In532364547 |ULTIMATE.start_main_#t~ite39_Out532364547|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In532364547 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd0~0_In532364547 256) 0)) (= (mod ~z$w_buff0_used~0_In532364547 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In532364547 256)) .cse1)))) (and (= |ULTIMATE.start_main_#t~ite39_In532364547| |ULTIMATE.start_main_#t~ite39_Out532364547|) (= |ULTIMATE.start_main_#t~ite40_Out532364547| ~z$w_buff1_used~0_In532364547) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In532364547, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532364547, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In532364547|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In532364547, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532364547, ~weak$$choice2~0=~weak$$choice2~0_In532364547} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In532364547, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out532364547|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out532364547|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532364547, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In532364547, ~z$w_buff1_used~0=~z$w_buff1_used~0_In532364547, ~weak$$choice2~0=~weak$$choice2~0_In532364547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:50:00,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:50:00,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite46_Out-1465206255| |ULTIMATE.start_main_#t~ite45_Out-1465206255|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1465206255 256))) (.cse5 (= (mod ~z$r_buff1_thd0~0_In-1465206255 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1465206255 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1465206255 256))) (.cse4 (= 0 (mod ~z$r_buff0_thd0~0_In-1465206255 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_In-1465206255| |ULTIMATE.start_main_#t~ite44_Out-1465206255|) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1465206255| |ULTIMATE.start_main_#t~ite45_In-1465206255|) (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1465206255| ~z$r_buff1_thd0~0_In-1465206255)) (and .cse1 (= |ULTIMATE.start_main_#t~ite45_Out-1465206255| ~z$r_buff1_thd0~0_In-1465206255) .cse0 (or .cse2 (and .cse3 .cse4) (and .cse4 .cse5))))) (let ((.cse6 (not .cse4))) (and .cse1 (= |ULTIMATE.start_main_#t~ite45_Out-1465206255| |ULTIMATE.start_main_#t~ite44_Out-1465206255|) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1465206255|) .cse0 (or .cse6 (not .cse5)) (or .cse6 (not .cse3)) (not .cse2))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1465206255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1465206255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1465206255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1465206255, ~weak$$choice2~0=~weak$$choice2~0_In-1465206255, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-1465206255|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1465206255|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1465206255, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1465206255, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1465206255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1465206255, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1465206255|, ~weak$$choice2~0=~weak$$choice2~0_In-1465206255, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1465206255|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1465206255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:50:00,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:50:00,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:50:00,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:50:00 BasicIcfg [2019-12-18 21:50:00,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:50:00,319 INFO L168 Benchmark]: Toolchain (without parser) took 35700.56 ms. Allocated memory was 138.9 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 102.5 MB in the beginning and 813.7 MB in the end (delta: -711.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,319 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 900.29 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 156.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,322 INFO L168 Benchmark]: Boogie Preprocessor took 42.88 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,322 INFO L168 Benchmark]: RCFGBuilder took 867.50 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,323 INFO L168 Benchmark]: TraceAbstraction took 33804.02 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.8 MB in the beginning and 813.7 MB in the end (delta: -712.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 21:50:00,327 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.51 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 900.29 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.1 MB in the beginning and 156.1 MB in the end (delta: -54.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.88 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.50 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 101.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33804.02 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.8 MB in the beginning and 813.7 MB in the end (delta: -712.8 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L847] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L848] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L849] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L850] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 33.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2001 SDtfs, 2552 SDslu, 4842 SDs, 0 SdLazy, 1942 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 33645 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 132567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...