/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/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:28:14,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:28:14,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:28:14,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:28:14,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:28:14,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:28:14,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:28:14,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:28:14,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:28:14,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:28:14,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:28:14,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:28:14,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:28:14,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:28:14,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:28:14,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:28:14,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:28:14,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:28:14,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:28:14,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:28:14,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:28:14,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:28:14,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:28:14,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:28:14,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:28:14,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:28:14,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:28:14,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:28:14,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:28:14,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:28:14,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:28:14,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:28:14,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:28:14,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:28:14,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:28:14,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:28:14,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:28:14,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:28:14,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:28:14,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:28:14,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:28:14,531 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 22:28:14,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:28:14,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:28:14,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:28:14,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:28:14,546 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:28:14,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:28:14,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:28:14,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:28:14,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:28:14,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:28:14,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:28:14,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:28:14,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:28:14,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:28:14,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:28:14,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:28:14,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:28:14,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:28:14,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:28:14,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:28:14,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:28:14,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:28:14,550 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:28:14,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:28:14,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:28:14,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:28:14,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:28:14,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:28:14,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:28:14,855 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:28:14,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-18 22:28:14,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de66283d/90b8fb1033b845d7bd142648c699a4bb/FLAG153453e50 [2019-12-18 22:28:15,523 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:28:15,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-18 22:28:15,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de66283d/90b8fb1033b845d7bd142648c699a4bb/FLAG153453e50 [2019-12-18 22:28:15,822 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8de66283d/90b8fb1033b845d7bd142648c699a4bb [2019-12-18 22:28:15,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:28:15,833 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:28:15,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:15,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:28:15,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:28:15,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2075a967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:15, skipping insertion in model container [2019-12-18 22:28:15,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:28:15" (1/1) ... [2019-12-18 22:28:15,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:28:15,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:28:16,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:16,513 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:28:16,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:28:16,673 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:28:16,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16 WrapperNode [2019-12-18 22:28:16,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:28:16,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:16,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:28:16,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:28:16,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:28:16,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:28:16,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:28:16,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:28:16,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (1/1) ... [2019-12-18 22:28:16,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:28:16,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:28:16,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:28:16,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:28:16,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (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 22:28:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:28:16,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:28:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:28:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:28:16,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:28:16,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:28:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:28:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:28:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:28:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:28:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:28:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:28:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:28:16,862 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 22:28:17,642 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:28:17,642 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:28:17,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:17 BoogieIcfgContainer [2019-12-18 22:28:17,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:28:17,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:28:17,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:28:17,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:28:17,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:28:15" (1/3) ... [2019-12-18 22:28:17,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6ee7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:17, skipping insertion in model container [2019-12-18 22:28:17,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:28:16" (2/3) ... [2019-12-18 22:28:17,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6ee7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:28:17, skipping insertion in model container [2019-12-18 22:28:17,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:28:17" (3/3) ... [2019-12-18 22:28:17,653 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-18 22:28:17,662 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:28:17,662 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:28:17,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:28:17,670 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:28:17,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,764 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,772 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,773 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:28:17,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:28:17,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:28:17,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:28:17,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:28:17,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:28:17,807 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:28:17,807 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:28:17,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:28:17,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:28:17,824 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 22:28:17,826 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:17,926 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:17,926 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:17,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:17,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 22:28:18,024 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 22:28:18,024 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:28:18,042 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:28:18,061 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:28:18,062 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:28:21,461 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 22:28:21,583 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 22:28:21,614 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-18 22:28:21,615 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:28:21,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-18 22:28:44,066 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-18 22:28:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-18 22:28:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:28:44,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:28:44,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:28:44,076 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:28:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:28:44,082 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-18 22:28:44,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:28:44,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972238653] [2019-12-18 22:28:44,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:28:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:28:44,327 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 22:28:44,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972238653] [2019-12-18 22:28:44,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:28:44,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:28:44,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852137634] [2019-12-18 22:28:44,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:28:44,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:28:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:28:44,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:28:44,354 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-18 22:28:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:28:48,287 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-18 22:28:48,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:28:48,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:28:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:28:49,226 INFO L225 Difference]: With dead ends: 129324 [2019-12-18 22:28:49,226 INFO L226 Difference]: Without dead ends: 126776 [2019-12-18 22:28:49,228 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 22:28:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-18 22:28:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-18 22:28:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-18 22:28:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-18 22:28:58,942 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-18 22:28:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:28:58,943 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-18 22:28:58,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:28:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-18 22:28:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:28:58,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:28:58,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:28:58,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:28:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:28:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-18 22:28:58,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:28:58,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492205971] [2019-12-18 22:28:58,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:28:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:28:59,090 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 22:28:59,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492205971] [2019-12-18 22:28:59,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:28:59,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:28:59,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680631257] [2019-12-18 22:28:59,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:28:59,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:28:59,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:28:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:28:59,094 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-18 22:29:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:04,713 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-18 22:29:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:04,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:29:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:05,383 INFO L225 Difference]: With dead ends: 198216 [2019-12-18 22:29:05,383 INFO L226 Difference]: Without dead ends: 198167 [2019-12-18 22:29:05,384 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 22:29:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-18 22:29:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-18 22:29:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-18 22:29:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-18 22:29:21,408 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-18 22:29:21,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:21,409 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-18 22:29:21,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-18 22:29:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:21,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:21,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:21,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-18 22:29:21,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:21,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49410978] [2019-12-18 22:29:21,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:29:21,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49410978] [2019-12-18 22:29:21,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:21,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:21,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496348100] [2019-12-18 22:29:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:21,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:21,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:21,542 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-18 22:29:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:29,799 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-18 22:29:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:29,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:29:29,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:30,747 INFO L225 Difference]: With dead ends: 260296 [2019-12-18 22:29:30,747 INFO L226 Difference]: Without dead ends: 260233 [2019-12-18 22:29:30,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-18 22:29:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-18 22:29:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-18 22:29:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-18 22:29:52,832 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-18 22:29:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:52,832 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-18 22:29:52,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-18 22:29:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:29:52,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:52,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:52,837 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-18 22:29:52,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:52,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743565317] [2019-12-18 22:29:52,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:52,907 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 22:29:52,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743565317] [2019-12-18 22:29:52,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:52,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:29:52,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072424502] [2019-12-18 22:29:52,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:52,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:52,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:52,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:52,909 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-18 22:29:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:53,052 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-18 22:29:53,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:53,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:29:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:53,119 INFO L225 Difference]: With dead ends: 42754 [2019-12-18 22:29:53,119 INFO L226 Difference]: Without dead ends: 42754 [2019-12-18 22:29:53,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-18 22:29:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-18 22:29:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-18 22:29:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-18 22:29:53,830 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-18 22:29:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:53,830 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-18 22:29:53,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-18 22:29:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:29:53,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:53,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:53,836 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-18 22:29:53,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:53,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289611787] [2019-12-18 22:29:53,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:53,942 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 22:29:53,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289611787] [2019-12-18 22:29:53,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:53,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:53,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745531416] [2019-12-18 22:29:53,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:53,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:53,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:53,944 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-18 22:29:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:56,523 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-18 22:29:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:29:56,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:29:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:56,629 INFO L225 Difference]: With dead ends: 57358 [2019-12-18 22:29:56,629 INFO L226 Difference]: Without dead ends: 57345 [2019-12-18 22:29:56,630 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 22:29:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-18 22:29:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-18 22:29:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-18 22:29:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-18 22:29:57,564 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-18 22:29:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:57,564 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-18 22:29:57,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-18 22:29:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:29:57,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:57,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:57,577 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-18 22:29:57,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:57,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810976558] [2019-12-18 22:29:57,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:57,639 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 22:29:57,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810976558] [2019-12-18 22:29:57,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:57,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:57,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118811477] [2019-12-18 22:29:57,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:29:57,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:29:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:57,641 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-18 22:29:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:57,686 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-18 22:29:57,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:29:57,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:29:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:57,700 INFO L225 Difference]: With dead ends: 8037 [2019-12-18 22:29:57,701 INFO L226 Difference]: Without dead ends: 8037 [2019-12-18 22:29:57,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:29:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-18 22:29:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-18 22:29:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-18 22:29:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-18 22:29:57,811 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-18 22:29:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:57,812 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-18 22:29:57,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:29:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-18 22:29:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:29:57,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:57,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:57,823 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-18 22:29:57,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:57,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924209043] [2019-12-18 22:29:57,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:57,896 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 22:29:57,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924209043] [2019-12-18 22:29:57,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:57,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:29:57,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506944851] [2019-12-18 22:29:57,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:57,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:57,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:57,900 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-18 22:29:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:57,943 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-18 22:29:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:29:57,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:29:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:57,954 INFO L225 Difference]: With dead ends: 5718 [2019-12-18 22:29:57,954 INFO L226 Difference]: Without dead ends: 5314 [2019-12-18 22:29:57,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-18 22:29:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-18 22:29:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 22:29:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-18 22:29:58,778 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-18 22:29:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:58,778 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-18 22:29:58,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-18 22:29:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:58,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:58,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:58,788 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-18 22:29:58,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:58,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441526244] [2019-12-18 22:29:58,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:58,889 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 22:29:58,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441526244] [2019-12-18 22:29:58,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:58,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:29:58,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250278904] [2019-12-18 22:29:58,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:29:58,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:58,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:29:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:29:58,891 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-18 22:29:58,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:58,964 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-18 22:29:58,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:29:58,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:29:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:58,979 INFO L225 Difference]: With dead ends: 4959 [2019-12-18 22:29:58,979 INFO L226 Difference]: Without dead ends: 4959 [2019-12-18 22:29:58,981 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 22:29:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-18 22:29:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-18 22:29:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-18 22:29:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-18 22:29:59,084 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-18 22:29:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:59,085 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-18 22:29:59,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:29:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-18 22:29:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:59,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:59,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:59,094 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-18 22:29:59,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:59,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894343964] [2019-12-18 22:29:59,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:59,243 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 22:29:59,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894343964] [2019-12-18 22:29:59,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:59,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:29:59,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213158610] [2019-12-18 22:29:59,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:59,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:59,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:59,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:59,249 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 5 states. [2019-12-18 22:29:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:29:59,565 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-18 22:29:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:29:59,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:29:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:29:59,578 INFO L225 Difference]: With dead ends: 7546 [2019-12-18 22:29:59,578 INFO L226 Difference]: Without dead ends: 7546 [2019-12-18 22:29:59,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:29:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-18 22:29:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-18 22:29:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-18 22:29:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-18 22:29:59,680 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-18 22:29:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:29:59,680 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-18 22:29:59,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:29:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-18 22:29:59,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:29:59,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:29:59,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:29:59,690 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:29:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:29:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-18 22:29:59,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:29:59,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771996971] [2019-12-18 22:29:59,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:29:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:29:59,802 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 22:29:59,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771996971] [2019-12-18 22:29:59,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:29:59,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:29:59,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371804089] [2019-12-18 22:29:59,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:29:59,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:29:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:29:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:29:59,806 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-18 22:30:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:00,188 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-18 22:30:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:30:00,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:30:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:00,219 INFO L225 Difference]: With dead ends: 9350 [2019-12-18 22:30:00,219 INFO L226 Difference]: Without dead ends: 9350 [2019-12-18 22:30:00,219 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 22:30:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-18 22:30:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-18 22:30:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-18 22:30:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-18 22:30:00,399 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-18 22:30:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:00,400 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-18 22:30:00,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:30:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-18 22:30:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:00,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:00,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:00,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-18 22:30:00,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:00,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052328392] [2019-12-18 22:30:00,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:00,533 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 22:30:00,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052328392] [2019-12-18 22:30:00,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:00,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:30:00,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239794596] [2019-12-18 22:30:00,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:30:00,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:30:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:00,536 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 6 states. [2019-12-18 22:30:01,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:01,083 INFO L93 Difference]: Finished difference Result 11291 states and 32444 transitions. [2019-12-18 22:30:01,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:30:01,084 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:30:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:01,103 INFO L225 Difference]: With dead ends: 11291 [2019-12-18 22:30:01,104 INFO L226 Difference]: Without dead ends: 11291 [2019-12-18 22:30:01,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:30:01,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2019-12-18 22:30:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 7569. [2019-12-18 22:30:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 22:30:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 21975 transitions. [2019-12-18 22:30:01,296 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 21975 transitions. Word has length 65 [2019-12-18 22:30:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:01,296 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 21975 transitions. [2019-12-18 22:30:01,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:30:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 21975 transitions. [2019-12-18 22:30:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:01,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:01,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:01,310 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-18 22:30:01,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:01,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159299363] [2019-12-18 22:30:01,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:01,470 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 22:30:01,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159299363] [2019-12-18 22:30:01,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:01,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:30:01,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313752606] [2019-12-18 22:30:01,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:30:01,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:01,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:30:01,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:30:01,473 INFO L87 Difference]: Start difference. First operand 7569 states and 21975 transitions. Second operand 7 states. [2019-12-18 22:30:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:02,063 INFO L93 Difference]: Finished difference Result 10727 states and 30551 transitions. [2019-12-18 22:30:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:30:02,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:30:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:02,079 INFO L225 Difference]: With dead ends: 10727 [2019-12-18 22:30:02,079 INFO L226 Difference]: Without dead ends: 10727 [2019-12-18 22:30:02,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:30:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10727 states. [2019-12-18 22:30:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10727 to 7940. [2019-12-18 22:30:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7940 states. [2019-12-18 22:30:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7940 states to 7940 states and 23023 transitions. [2019-12-18 22:30:02,200 INFO L78 Accepts]: Start accepts. Automaton has 7940 states and 23023 transitions. Word has length 65 [2019-12-18 22:30:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:02,200 INFO L462 AbstractCegarLoop]: Abstraction has 7940 states and 23023 transitions. [2019-12-18 22:30:02,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:30:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7940 states and 23023 transitions. [2019-12-18 22:30:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:02,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:02,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:02,211 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:02,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:02,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1501839526, now seen corresponding path program 5 times [2019-12-18 22:30:02,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:02,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897175631] [2019-12-18 22:30:02,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:02,322 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 22:30:02,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897175631] [2019-12-18 22:30:02,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:02,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:30:02,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893202223] [2019-12-18 22:30:02,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:30:02,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:30:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:30:02,325 INFO L87 Difference]: Start difference. First operand 7940 states and 23023 transitions. Second operand 7 states. [2019-12-18 22:30:04,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:04,716 INFO L93 Difference]: Finished difference Result 12186 states and 34927 transitions. [2019-12-18 22:30:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:30:04,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:30:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:04,737 INFO L225 Difference]: With dead ends: 12186 [2019-12-18 22:30:04,738 INFO L226 Difference]: Without dead ends: 12186 [2019-12-18 22:30:04,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:30:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12186 states. [2019-12-18 22:30:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12186 to 7567. [2019-12-18 22:30:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7567 states. [2019-12-18 22:30:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 21942 transitions. [2019-12-18 22:30:04,882 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 21942 transitions. Word has length 65 [2019-12-18 22:30:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:04,882 INFO L462 AbstractCegarLoop]: Abstraction has 7567 states and 21942 transitions. [2019-12-18 22:30:04,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:30:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 21942 transitions. [2019-12-18 22:30:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:04,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:04,894 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:04,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1065820274, now seen corresponding path program 6 times [2019-12-18 22:30:04,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:04,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632285378] [2019-12-18 22:30:04,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:05,024 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 22:30:05,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632285378] [2019-12-18 22:30:05,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:05,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:30:05,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978126786] [2019-12-18 22:30:05,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:30:05,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:30:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:30:05,026 INFO L87 Difference]: Start difference. First operand 7567 states and 21942 transitions. Second operand 7 states. [2019-12-18 22:30:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:06,069 INFO L93 Difference]: Finished difference Result 11651 states and 33161 transitions. [2019-12-18 22:30:06,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:30:06,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 22:30:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:06,086 INFO L225 Difference]: With dead ends: 11651 [2019-12-18 22:30:06,086 INFO L226 Difference]: Without dead ends: 11651 [2019-12-18 22:30:06,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:30:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11651 states. [2019-12-18 22:30:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11651 to 8099. [2019-12-18 22:30:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8099 states. [2019-12-18 22:30:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8099 states to 8099 states and 23494 transitions. [2019-12-18 22:30:06,231 INFO L78 Accepts]: Start accepts. Automaton has 8099 states and 23494 transitions. Word has length 65 [2019-12-18 22:30:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:06,231 INFO L462 AbstractCegarLoop]: Abstraction has 8099 states and 23494 transitions. [2019-12-18 22:30:06,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:30:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8099 states and 23494 transitions. [2019-12-18 22:30:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:06,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:06,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:06,241 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1998682062, now seen corresponding path program 7 times [2019-12-18 22:30:06,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:06,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156009347] [2019-12-18 22:30:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:06,368 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 22:30:06,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156009347] [2019-12-18 22:30:06,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:06,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:30:06,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509522524] [2019-12-18 22:30:06,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:30:06,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:30:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:30:06,370 INFO L87 Difference]: Start difference. First operand 8099 states and 23494 transitions. Second operand 8 states. [2019-12-18 22:30:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,227 INFO L93 Difference]: Finished difference Result 12961 states and 37082 transitions. [2019-12-18 22:30:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:30:07,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 22:30:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,245 INFO L225 Difference]: With dead ends: 12961 [2019-12-18 22:30:07,245 INFO L226 Difference]: Without dead ends: 12961 [2019-12-18 22:30:07,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:30:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states. [2019-12-18 22:30:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 7779. [2019-12-18 22:30:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-18 22:30:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 22600 transitions. [2019-12-18 22:30:07,387 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 22600 transitions. Word has length 65 [2019-12-18 22:30:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:07,387 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 22600 transitions. [2019-12-18 22:30:07,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:30:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 22600 transitions. [2019-12-18 22:30:07,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:07,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:07,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:30:07,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:07,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1274457040, now seen corresponding path program 8 times [2019-12-18 22:30:07,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:07,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070926259] [2019-12-18 22:30:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:30:07,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070926259] [2019-12-18 22:30:07,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:07,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:30:07,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736001347] [2019-12-18 22:30:07,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:30:07,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:30:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:30:07,499 INFO L87 Difference]: Start difference. First operand 7779 states and 22600 transitions. Second operand 6 states. [2019-12-18 22:30:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,604 INFO L93 Difference]: Finished difference Result 13773 states and 40032 transitions. [2019-12-18 22:30:07,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:30:07,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:30:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,616 INFO L225 Difference]: With dead ends: 13773 [2019-12-18 22:30:07,617 INFO L226 Difference]: Without dead ends: 7361 [2019-12-18 22:30:07,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:30:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2019-12-18 22:30:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 7361. [2019-12-18 22:30:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7361 states. [2019-12-18 22:30:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7361 states to 7361 states and 21357 transitions. [2019-12-18 22:30:07,720 INFO L78 Accepts]: Start accepts. Automaton has 7361 states and 21357 transitions. Word has length 65 [2019-12-18 22:30:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:07,720 INFO L462 AbstractCegarLoop]: Abstraction has 7361 states and 21357 transitions. [2019-12-18 22:30:07,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:30:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7361 states and 21357 transitions. [2019-12-18 22:30:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:30:07,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:07,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:07,728 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1455683980, now seen corresponding path program 9 times [2019-12-18 22:30:07,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:07,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572436868] [2019-12-18 22:30:07,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:07,781 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 22:30:07,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572436868] [2019-12-18 22:30:07,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:07,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874130040] [2019-12-18 22:30:07,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:07,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:07,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:07,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:07,783 INFO L87 Difference]: Start difference. First operand 7361 states and 21357 transitions. Second operand 3 states. [2019-12-18 22:30:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:07,889 INFO L93 Difference]: Finished difference Result 6221 states and 17687 transitions. [2019-12-18 22:30:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:07,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:30:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:07,900 INFO L225 Difference]: With dead ends: 6221 [2019-12-18 22:30:07,900 INFO L226 Difference]: Without dead ends: 6221 [2019-12-18 22:30:07,903 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 22:30:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6221 states. [2019-12-18 22:30:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6221 to 6221. [2019-12-18 22:30:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6221 states. [2019-12-18 22:30:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 17687 transitions. [2019-12-18 22:30:08,029 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 17687 transitions. Word has length 65 [2019-12-18 22:30:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:08,029 INFO L462 AbstractCegarLoop]: Abstraction has 6221 states and 17687 transitions. [2019-12-18 22:30:08,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 17687 transitions. [2019-12-18 22:30:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:30:08,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:08,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:08,039 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1664932582, now seen corresponding path program 1 times [2019-12-18 22:30:08,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:08,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800797178] [2019-12-18 22:30:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:08,108 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 22:30:08,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800797178] [2019-12-18 22:30:08,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:08,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:08,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743832281] [2019-12-18 22:30:08,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:08,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:08,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:08,110 INFO L87 Difference]: Start difference. First operand 6221 states and 17687 transitions. Second operand 3 states. [2019-12-18 22:30:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:08,168 INFO L93 Difference]: Finished difference Result 6220 states and 17685 transitions. [2019-12-18 22:30:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:30:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:08,178 INFO L225 Difference]: With dead ends: 6220 [2019-12-18 22:30:08,178 INFO L226 Difference]: Without dead ends: 6220 [2019-12-18 22:30:08,180 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 22:30:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6220 states. [2019-12-18 22:30:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6220 to 3710. [2019-12-18 22:30:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2019-12-18 22:30:08,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 10678 transitions. [2019-12-18 22:30:08,267 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 10678 transitions. Word has length 66 [2019-12-18 22:30:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:08,267 INFO L462 AbstractCegarLoop]: Abstraction has 3710 states and 10678 transitions. [2019-12-18 22:30:08,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 10678 transitions. [2019-12-18 22:30:08,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:30:08,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:08,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:08,271 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:08,272 INFO L82 PathProgramCache]: Analyzing trace with hash -575924262, now seen corresponding path program 1 times [2019-12-18 22:30:08,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:08,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072587144] [2019-12-18 22:30:08,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:08,339 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 22:30:08,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072587144] [2019-12-18 22:30:08,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:08,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:30:08,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995616628] [2019-12-18 22:30:08,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:30:08,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:08,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:30:08,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:30:08,342 INFO L87 Difference]: Start difference. First operand 3710 states and 10678 transitions. Second operand 3 states. [2019-12-18 22:30:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:08,367 INFO L93 Difference]: Finished difference Result 3510 states and 9880 transitions. [2019-12-18 22:30:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:30:08,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:30:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:08,374 INFO L225 Difference]: With dead ends: 3510 [2019-12-18 22:30:08,374 INFO L226 Difference]: Without dead ends: 3510 [2019-12-18 22:30:08,374 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 22:30:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2019-12-18 22:30:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2817. [2019-12-18 22:30:08,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-18 22:30:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7945 transitions. [2019-12-18 22:30:08,441 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7945 transitions. Word has length 67 [2019-12-18 22:30:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:08,442 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7945 transitions. [2019-12-18 22:30:08,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:30:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7945 transitions. [2019-12-18 22:30:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:08,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:08,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:08,449 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-18 22:30:08,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:08,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158138909] [2019-12-18 22:30:08,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:08,835 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 22:30:08,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158138909] [2019-12-18 22:30:08,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:08,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:30:08,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193396297] [2019-12-18 22:30:08,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:30:08,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:30:08,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:30:08,839 INFO L87 Difference]: Start difference. First operand 2817 states and 7945 transitions. Second operand 13 states. [2019-12-18 22:30:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:09,607 INFO L93 Difference]: Finished difference Result 4980 states and 13978 transitions. [2019-12-18 22:30:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 22:30:09,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 22:30:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:09,614 INFO L225 Difference]: With dead ends: 4980 [2019-12-18 22:30:09,614 INFO L226 Difference]: Without dead ends: 4948 [2019-12-18 22:30:09,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:30:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4948 states. [2019-12-18 22:30:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4948 to 3948. [2019-12-18 22:30:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 22:30:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-18 22:30:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-18 22:30:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:09,673 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-18 22:30:09,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:30:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-18 22:30:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:09,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:09,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:09,678 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 2 times [2019-12-18 22:30:09,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:09,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532974823] [2019-12-18 22:30:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:09,938 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 22:30:09,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532974823] [2019-12-18 22:30:09,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:09,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:30:09,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925421045] [2019-12-18 22:30:09,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:30:09,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:30:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:30:09,941 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 14 states. [2019-12-18 22:30:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:10,663 INFO L93 Difference]: Finished difference Result 7046 states and 19795 transitions. [2019-12-18 22:30:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:30:10,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 22:30:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:10,677 INFO L225 Difference]: With dead ends: 7046 [2019-12-18 22:30:10,677 INFO L226 Difference]: Without dead ends: 7014 [2019-12-18 22:30:10,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2019-12-18 22:30:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-18 22:30:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4160. [2019-12-18 22:30:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-18 22:30:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-18 22:30:10,795 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-18 22:30:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:10,795 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-18 22:30:10,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:30:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-18 22:30:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:10,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:10,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:10,801 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 3 times [2019-12-18 22:30:10,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:10,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075635492] [2019-12-18 22:30:10,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:30:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:30:11,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075635492] [2019-12-18 22:30:11,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:30:11,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:30:11,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141377939] [2019-12-18 22:30:11,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:30:11,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:30:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:30:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:30:11,056 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 14 states. [2019-12-18 22:30:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:30:11,734 INFO L93 Difference]: Finished difference Result 6163 states and 17081 transitions. [2019-12-18 22:30:11,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:30:11,734 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 22:30:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:30:11,743 INFO L225 Difference]: With dead ends: 6163 [2019-12-18 22:30:11,743 INFO L226 Difference]: Without dead ends: 6131 [2019-12-18 22:30:11,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-18 22:30:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-12-18 22:30:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 4069. [2019-12-18 22:30:11,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-18 22:30:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 11331 transitions. [2019-12-18 22:30:11,829 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 11331 transitions. Word has length 68 [2019-12-18 22:30:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:30:11,829 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 11331 transitions. [2019-12-18 22:30:11,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:30:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 11331 transitions. [2019-12-18 22:30:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:30:11,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:30:11,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:30:11,834 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:30:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:30:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 4 times [2019-12-18 22:30:11,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:30:11,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050553532] [2019-12-18 22:30:11,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:30:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:30:11,971 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:30:11,972 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:30:11,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22|) |v_ULTIMATE.start_main_~#t1967~0.offset_16| 0)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_16|) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1967~0.base_22| 4)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_22|) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22|)) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~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_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_20|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_22|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_15|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, 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_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, 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~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:11,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-18 22:30:11,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:30:11,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 22:30:11,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1927528655 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1927528655 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1927528655|)) (and (= ~z$w_buff0_used~0_In-1927528655 |P0Thread1of1ForFork0_#t~ite5_Out-1927528655|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927528655, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1927528655} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1927528655|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927528655, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1927528655} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:30:12,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1463363471 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1463363471 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1463363471 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1463363471 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1463363471| ~z$w_buff1_used~0_In-1463363471) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1463363471|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1463363471, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1463363471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1463363471, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1463363471} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1463363471|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1463363471, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1463363471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1463363471, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1463363471} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:30:12,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1663931145 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1663931145 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In-1663931145 ~z$r_buff0_thd1~0_Out-1663931145) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-1663931145 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1663931145, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1663931145} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1663931145, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1663931145|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1663931145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:30:12,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-188760137 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-188760137 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-188760137 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-188760137 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-188760137| ~z$r_buff1_thd1~0_In-188760137)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-188760137| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-188760137, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-188760137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-188760137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-188760137} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-188760137, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-188760137|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-188760137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-188760137, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-188760137} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:30:12,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:30:12,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In538227810 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In538227810 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In538227810 |P1Thread1of1ForFork1_#t~ite9_Out538227810|) (not .cse1)) (and (= ~z~0_In538227810 |P1Thread1of1ForFork1_#t~ite9_Out538227810|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In538227810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In538227810, ~z$w_buff1~0=~z$w_buff1~0_In538227810, ~z~0=~z~0_In538227810} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out538227810|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In538227810, ~z$w_buff1_used~0=~z$w_buff1_used~0_In538227810, ~z$w_buff1~0=~z$w_buff1~0_In538227810, ~z~0=~z~0_In538227810} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 22:30:12,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 22:30:12,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-947266463 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-947266463 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-947266463| ~z$w_buff0_used~0_In-947266463) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-947266463| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-947266463, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-947266463} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-947266463, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-947266463|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-947266463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:30:12,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1001378399 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1001378399 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1001378399| ~z$w_buff1~0_In-1001378399) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1001378399| ~z~0_In-1001378399) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1001378399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1001378399, ~z$w_buff1~0=~z$w_buff1~0_In-1001378399, ~z~0=~z~0_In-1001378399} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1001378399|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1001378399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1001378399, ~z$w_buff1~0=~z$w_buff1~0_In-1001378399, ~z~0=~z~0_In-1001378399} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:30:12,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1695140442 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1695140442 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1695140442 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1695140442 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out1695140442| ~z$w_buff1_used~0_In1695140442)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out1695140442| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1695140442, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1695140442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695140442, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1695140442} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1695140442, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1695140442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1695140442, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1695140442|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1695140442} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:30:12,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1213791134 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1213791134 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1213791134 |P1Thread1of1ForFork1_#t~ite13_Out1213791134|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1213791134|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1213791134, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1213791134} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1213791134, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1213791134|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1213791134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:30:12,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:30:12,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-45793862 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-45793862 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-45793862 |P2Thread1of1ForFork2_#t~ite17_Out-45793862|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-45793862|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-45793862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-45793862} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-45793862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-45793862, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-45793862|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:30:12,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In609924783 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In609924783 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In609924783 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In609924783 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite18_Out609924783| ~z$w_buff1_used~0_In609924783) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite18_Out609924783| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In609924783, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In609924783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609924783, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In609924783} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In609924783, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In609924783, ~z$w_buff1_used~0=~z$w_buff1_used~0_In609924783, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In609924783, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out609924783|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:30:12,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1125581290 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1125581290 256) 0))) (or (and (= ~z$r_buff0_thd3~0_In1125581290 |P2Thread1of1ForFork2_#t~ite19_Out1125581290|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1125581290|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1125581290, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1125581290} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1125581290, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1125581290, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1125581290|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:30:12,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1071119752 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1071119752 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1071119752 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1071119752 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1071119752|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-1071119752| ~z$r_buff1_thd3~0_In-1071119752) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1071119752, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1071119752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1071119752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1071119752} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1071119752, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1071119752|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1071119752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1071119752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1071119752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:30:12,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:30:12,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-519269832 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-519269832 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-519269832 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-519269832 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-519269832| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-519269832| ~z$r_buff1_thd2~0_In-519269832) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-519269832, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-519269832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-519269832, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-519269832} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-519269832, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-519269832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-519269832, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-519269832|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-519269832} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:30:12,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:30:12,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:30:12,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603059968 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1603059968 256)))) (or (and (= ~z$w_buff1~0_In1603059968 |ULTIMATE.start_main_#t~ite24_Out1603059968|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1603059968 |ULTIMATE.start_main_#t~ite24_Out1603059968|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603059968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603059968, ~z$w_buff1~0=~z$w_buff1~0_In1603059968, ~z~0=~z~0_In1603059968} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603059968, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1603059968|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603059968, ~z$w_buff1~0=~z$w_buff1~0_In1603059968, ~z~0=~z~0_In1603059968} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 22:30:12,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 22:30:12,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1787976621 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1787976621 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out1787976621| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out1787976621| ~z$w_buff0_used~0_In1787976621) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787976621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787976621} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787976621, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787976621, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1787976621|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:30:12,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1805615950 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1805615950 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1805615950 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1805615950 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1805615950|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1805615950 |ULTIMATE.start_main_#t~ite27_Out-1805615950|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1805615950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805615950, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1805615950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1805615950} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1805615950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1805615950, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1805615950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1805615950, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1805615950|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:30:12,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1622013426 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1622013426 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1622013426 |ULTIMATE.start_main_#t~ite28_Out-1622013426|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-1622013426| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1622013426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1622013426} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1622013426, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1622013426|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1622013426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:30:12,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-799325839 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-799325839 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-799325839 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-799325839 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-799325839 |ULTIMATE.start_main_#t~ite29_Out-799325839|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite29_Out-799325839| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-799325839, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-799325839, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-799325839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-799325839} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-799325839, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-799325839|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-799325839, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-799325839, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-799325839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:30:12,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= 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_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:30:12,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 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_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:30:12,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:30:12,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:30:12 BasicIcfg [2019-12-18 22:30:12,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:30:12,154 INFO L168 Benchmark]: Toolchain (without parser) took 116314.32 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 99.0 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,154 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.98 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 98.6 MB in the beginning and 153.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 149.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,156 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,156 INFO L168 Benchmark]: RCFGBuilder took 858.63 ms. Allocated memory is still 200.3 MB. Free memory was 147.7 MB in the beginning and 97.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,157 INFO L168 Benchmark]: TraceAbstraction took 114500.47 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 22:30:12,163 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 118.8 MB in the beginning and 118.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 839.98 ms. Allocated memory was 137.9 MB in the beginning and 200.3 MB in the end (delta: 62.4 MB). Free memory was 98.6 MB in the beginning and 153.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 200.3 MB. Free memory was 153.3 MB in the beginning and 149.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 858.63 ms. Allocated memory is still 200.3 MB. Free memory was 147.7 MB in the beginning and 97.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114500.47 ms. Allocated memory was 200.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 97.1 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 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 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 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 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 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) [L829] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 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)) [L830] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 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)) [L831] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 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)) [L832] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 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)) [L834] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 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)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 114.1s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3673 SDtfs, 3857 SDslu, 9554 SDs, 0 SdLazy, 5826 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred 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: 52.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 102248 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1086 ConstructedInterpolants, 0 QuantifiedInterpolants, 244997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...