/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:21:31,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:21:31,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:21:31,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:21:31,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:21:31,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:21:31,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:21:31,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:21:31,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:21:31,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:21:31,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:21:31,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:21:31,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:21:31,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:21:31,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:21:31,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:21:31,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:21:31,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:21:31,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:21:31,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:21:31,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:21:31,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:21:31,448 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:21:31,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:21:31,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:21:31,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:21:31,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:21:31,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:21:31,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:21:31,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:21:31,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:21:31,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:21:31,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:21:31,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:21:31,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:21:31,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:21:31,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:21:31,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:21:31,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:21:31,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:21:31,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:21:31,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:21:31,519 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:21:31,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:21:31,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:21:31,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:21:31,521 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:21:31,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:21:31,522 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:21:31,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:21:31,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:21:31,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:21:31,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:21:31,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:21:31,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:21:31,524 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:21:31,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:21:31,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:21:31,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:21:31,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:21:31,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:21:31,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:21:31,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:21:31,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:21:31,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:21:31,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:21:31,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:21:31,528 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:21:31,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:21:31,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:21:31,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:21:31,886 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:21:31,887 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:21:31,888 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2020-10-16 13:21:31,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3e05e4a0/60a8abe8ecef41bd94c4994f51eaa031/FLAG011b576ca [2020-10-16 13:21:32,472 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:21:32,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix053_pso.opt.i [2020-10-16 13:21:32,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3e05e4a0/60a8abe8ecef41bd94c4994f51eaa031/FLAG011b576ca [2020-10-16 13:21:32,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c3e05e4a0/60a8abe8ecef41bd94c4994f51eaa031 [2020-10-16 13:21:32,792 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:21:32,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:21:32,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:32,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:21:32,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:21:32,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:32" (1/1) ... [2020-10-16 13:21:32,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e86016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:32, skipping insertion in model container [2020-10-16 13:21:32,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:21:32" (1/1) ... [2020-10-16 13:21:32,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:21:32,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:21:33,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:33,549 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:21:33,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:21:33,755 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:21:33,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33 WrapperNode [2020-10-16 13:21:33,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:21:33,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:33,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:21:33,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:21:33,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:21:33,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:21:33,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:21:33,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:21:33,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... [2020-10-16 13:21:33,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:21:33,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:21:33,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:21:33,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:21:33,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-10-16 13:21:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:21:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:21:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:21:33,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:21:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:21:33,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:21:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:21:33,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:21:33,961 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:21:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:21:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 13:21:33,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 13:21:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:21:33,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:21:33,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:21:33,965 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:21:35,723 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:21:35,724 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:21:35,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:35 BoogieIcfgContainer [2020-10-16 13:21:35,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:21:35,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:21:35,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:21:35,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:21:35,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:21:32" (1/3) ... [2020-10-16 13:21:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b75e9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:35, skipping insertion in model container [2020-10-16 13:21:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:21:33" (2/3) ... [2020-10-16 13:21:35,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b75e9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:21:35, skipping insertion in model container [2020-10-16 13:21:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:21:35" (3/3) ... [2020-10-16 13:21:35,735 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_pso.opt.i [2020-10-16 13:21:35,747 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:21:35,748 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:21:35,755 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:21:35,756 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:21:35,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,822 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,827 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,828 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,829 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,830 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,831 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,832 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,833 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,837 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,838 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,838 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,838 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,839 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,840 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,841 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,851 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,852 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,852 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,865 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,865 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,866 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,866 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,866 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,866 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,866 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,867 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,867 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,868 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,868 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,875 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,875 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,876 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,876 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,877 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,878 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,878 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:21:35,882 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:21:35,897 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 13:21:35,920 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:21:35,921 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:21:35,921 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:21:35,921 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:21:35,921 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:21:35,921 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:21:35,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:21:35,922 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:21:35,945 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:21:35,945 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 13:21:35,949 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-16 13:21:35,951 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-16 13:21:36,030 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-16 13:21:36,030 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:21:36,037 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-16 13:21:36,043 INFO L117 LiptonReduction]: Number of co-enabled transitions 2248 [2020-10-16 13:21:36,401 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-16 13:21:36,975 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:21:37,817 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 13:21:38,584 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 13:21:38,719 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 13:21:38,824 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-10-16 13:21:38,860 INFO L132 LiptonReduction]: Checked pairs total: 4878 [2020-10-16 13:21:38,861 INFO L134 LiptonReduction]: Total number of compositions: 85 [2020-10-16 13:21:38,867 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-16 13:21:39,032 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-16 13:21:39,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-16 13:21:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:21:39,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:39,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:39,069 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash -543229691, now seen corresponding path program 1 times [2020-10-16 13:21:39,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:39,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194172419] [2020-10-16 13:21:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:39,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194172419] [2020-10-16 13:21:39,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:39,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:21:39,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [71873535] [2020-10-16 13:21:39,367 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:39,370 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:39,392 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:21:39,393 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:39,397 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:39,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:39,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:39,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:39,411 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-16 13:21:39,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:39,502 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-16 13:21:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:39,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:21:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:39,549 INFO L225 Difference]: With dead ends: 1770 [2020-10-16 13:21:39,549 INFO L226 Difference]: Without dead ends: 1450 [2020-10-16 13:21:39,551 INFO L677 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 [2020-10-16 13:21:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-16 13:21:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-16 13:21:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-16 13:21:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-16 13:21:39,720 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-16 13:21:39,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:39,721 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-16 13:21:39,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-16 13:21:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:21:39,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:39,727 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:39,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:21:39,727 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:39,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1942314390, now seen corresponding path program 1 times [2020-10-16 13:21:39,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:39,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651482976] [2020-10-16 13:21:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:39,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651482976] [2020-10-16 13:21:39,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:39,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:21:39,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752043778] [2020-10-16 13:21:39,819 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:39,821 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:39,823 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-16 13:21:39,823 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:39,823 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:39,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:39,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:39,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:39,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:39,825 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-16 13:21:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:39,849 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-16 13:21:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:39,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-16 13:21:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:39,862 INFO L225 Difference]: With dead ends: 1410 [2020-10-16 13:21:39,862 INFO L226 Difference]: Without dead ends: 1410 [2020-10-16 13:21:39,863 INFO L677 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 [2020-10-16 13:21:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-16 13:21:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-16 13:21:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-16 13:21:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-16 13:21:39,915 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-16 13:21:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:39,915 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-16 13:21:39,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-16 13:21:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:21:39,918 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:39,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:39,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:21:39,919 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 82203517, now seen corresponding path program 1 times [2020-10-16 13:21:39,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:39,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212063787] [2020-10-16 13:21:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:40,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212063787] [2020-10-16 13:21:40,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:40,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:21:40,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520235226] [2020-10-16 13:21:40,013 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:40,016 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:40,020 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-16 13:21:40,020 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:40,087 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:40,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:40,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:40,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:40,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,088 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 3 states. [2020-10-16 13:21:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:40,115 INFO L93 Difference]: Finished difference Result 1380 states and 5060 transitions. [2020-10-16 13:21:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:40,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 13:21:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:40,127 INFO L225 Difference]: With dead ends: 1380 [2020-10-16 13:21:40,128 INFO L226 Difference]: Without dead ends: 1380 [2020-10-16 13:21:40,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-10-16 13:21:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2020-10-16 13:21:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-10-16 13:21:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 5060 transitions. [2020-10-16 13:21:40,183 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 5060 transitions. Word has length 12 [2020-10-16 13:21:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:40,183 INFO L481 AbstractCegarLoop]: Abstraction has 1380 states and 5060 transitions. [2020-10-16 13:21:40,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 5060 transitions. [2020-10-16 13:21:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:21:40,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:40,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:40,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:21:40,187 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1886679985, now seen corresponding path program 1 times [2020-10-16 13:21:40,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:40,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787449434] [2020-10-16 13:21:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:40,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787449434] [2020-10-16 13:21:40,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:40,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:21:40,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1270030527] [2020-10-16 13:21:40,236 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:40,237 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:40,241 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-10-16 13:21:40,241 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:40,243 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:40,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:40,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:40,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:40,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,244 INFO L87 Difference]: Start difference. First operand 1380 states and 5060 transitions. Second operand 3 states. [2020-10-16 13:21:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:40,275 INFO L93 Difference]: Finished difference Result 1868 states and 6582 transitions. [2020-10-16 13:21:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:40,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-16 13:21:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:40,289 INFO L225 Difference]: With dead ends: 1868 [2020-10-16 13:21:40,289 INFO L226 Difference]: Without dead ends: 1460 [2020-10-16 13:21:40,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-10-16 13:21:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1340. [2020-10-16 13:21:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-16 13:21:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4694 transitions. [2020-10-16 13:21:40,387 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4694 transitions. Word has length 13 [2020-10-16 13:21:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:40,388 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 4694 transitions. [2020-10-16 13:21:40,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4694 transitions. [2020-10-16 13:21:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:21:40,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:40,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:40,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:21:40,390 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -538429830, now seen corresponding path program 1 times [2020-10-16 13:21:40,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:40,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507415089] [2020-10-16 13:21:40,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:40,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507415089] [2020-10-16 13:21:40,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:40,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:21:40,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1250353967] [2020-10-16 13:21:40,493 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:40,495 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:40,498 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-10-16 13:21:40,498 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:40,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:40,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:40,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-16 13:21:40,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:40,646 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [21905#(= (mod ~main$tmp_guard0~0 256) 0), 21906#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-16 13:21:40,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:21:40,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:21:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:21:40,648 INFO L87 Difference]: Start difference. First operand 1340 states and 4694 transitions. Second operand 6 states. [2020-10-16 13:21:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:40,708 INFO L93 Difference]: Finished difference Result 1028 states and 3153 transitions. [2020-10-16 13:21:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:21:40,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 13:21:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:40,714 INFO L225 Difference]: With dead ends: 1028 [2020-10-16 13:21:40,714 INFO L226 Difference]: Without dead ends: 708 [2020-10-16 13:21:40,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:21:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2020-10-16 13:21:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2020-10-16 13:21:40,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-10-16 13:21:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1994 transitions. [2020-10-16 13:21:40,738 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1994 transitions. Word has length 13 [2020-10-16 13:21:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:40,738 INFO L481 AbstractCegarLoop]: Abstraction has 708 states and 1994 transitions. [2020-10-16 13:21:40,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:21:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1994 transitions. [2020-10-16 13:21:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:21:40,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:40,741 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:40,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:21:40,741 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1173655825, now seen corresponding path program 1 times [2020-10-16 13:21:40,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:40,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985695208] [2020-10-16 13:21:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:40,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985695208] [2020-10-16 13:21:40,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:40,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:21:40,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386228585] [2020-10-16 13:21:40,793 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:40,796 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:40,807 INFO L258 McrAutomatonBuilder]: Finished intersection with 60 states and 113 transitions. [2020-10-16 13:21:40,808 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:40,957 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:40,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:21:40,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:21:40,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,958 INFO L87 Difference]: Start difference. First operand 708 states and 1994 transitions. Second operand 3 states. [2020-10-16 13:21:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:40,971 INFO L93 Difference]: Finished difference Result 990 states and 2682 transitions. [2020-10-16 13:21:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:21:40,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-16 13:21:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:40,977 INFO L225 Difference]: With dead ends: 990 [2020-10-16 13:21:40,977 INFO L226 Difference]: Without dead ends: 718 [2020-10-16 13:21:40,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:21:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-16 13:21:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 700. [2020-10-16 13:21:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-16 13:21:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1861 transitions. [2020-10-16 13:21:40,999 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1861 transitions. Word has length 17 [2020-10-16 13:21:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:41,000 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 1861 transitions. [2020-10-16 13:21:41,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:21:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1861 transitions. [2020-10-16 13:21:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:21:41,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:41,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:41,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:21:41,002 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 370067579, now seen corresponding path program 1 times [2020-10-16 13:21:41,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:41,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163749038] [2020-10-16 13:21:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:41,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163749038] [2020-10-16 13:21:41,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:41,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:21:41,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [450725621] [2020-10-16 13:21:41,095 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:41,099 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:41,110 INFO L258 McrAutomatonBuilder]: Finished intersection with 54 states and 95 transitions. [2020-10-16 13:21:41,110 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:41,254 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26754#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:21:41,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:21:41,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:41,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:21:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:21:41,256 INFO L87 Difference]: Start difference. First operand 700 states and 1861 transitions. Second operand 7 states. [2020-10-16 13:21:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:41,324 INFO L93 Difference]: Finished difference Result 607 states and 1569 transitions. [2020-10-16 13:21:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:21:41,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-16 13:21:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:41,328 INFO L225 Difference]: With dead ends: 607 [2020-10-16 13:21:41,328 INFO L226 Difference]: Without dead ends: 488 [2020-10-16 13:21:41,329 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:21:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-10-16 13:21:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-10-16 13:21:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-10-16 13:21:41,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1246 transitions. [2020-10-16 13:21:41,342 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1246 transitions. Word has length 17 [2020-10-16 13:21:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:41,343 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1246 transitions. [2020-10-16 13:21:41,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:21:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1246 transitions. [2020-10-16 13:21:41,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:21:41,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:41,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:21:41,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:21:41,345 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:41,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1261578529, now seen corresponding path program 1 times [2020-10-16 13:21:41,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:41,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113591374] [2020-10-16 13:21:41,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:41,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113591374] [2020-10-16 13:21:41,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:41,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 13:21:41,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087807768] [2020-10-16 13:21:41,521 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:41,526 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:41,566 INFO L258 McrAutomatonBuilder]: Finished intersection with 159 states and 358 transitions. [2020-10-16 13:21:41,566 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:41,880 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [28351#(<= ~__unbuffered_cnt~0 0)] [2020-10-16 13:21:41,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:21:41,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:21:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:21:41,881 INFO L87 Difference]: Start difference. First operand 488 states and 1246 transitions. Second operand 8 states. [2020-10-16 13:21:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:41,968 INFO L93 Difference]: Finished difference Result 465 states and 1200 transitions. [2020-10-16 13:21:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:21:41,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-16 13:21:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:41,970 INFO L225 Difference]: With dead ends: 465 [2020-10-16 13:21:41,971 INFO L226 Difference]: Without dead ends: 187 [2020-10-16 13:21:41,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-10-16 13:21:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-16 13:21:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-10-16 13:21:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-16 13:21:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 447 transitions. [2020-10-16 13:21:41,980 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 447 transitions. Word has length 20 [2020-10-16 13:21:41,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:41,981 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 447 transitions. [2020-10-16 13:21:41,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:21:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 447 transitions. [2020-10-16 13:21:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 13:21:41,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:41,982 INFO L422 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] [2020-10-16 13:21:41,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:21:41,982 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1242244738, now seen corresponding path program 1 times [2020-10-16 13:21:41,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:41,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473674262] [2020-10-16 13:21:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:42,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473674262] [2020-10-16 13:21:42,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:42,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:21:42,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738835650] [2020-10-16 13:21:42,040 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:42,045 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:42,186 INFO L258 McrAutomatonBuilder]: Finished intersection with 197 states and 441 transitions. [2020-10-16 13:21:42,186 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:42,545 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:21:42,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:21:42,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:21:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:21:42,547 INFO L87 Difference]: Start difference. First operand 187 states and 447 transitions. Second operand 4 states. [2020-10-16 13:21:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:42,567 INFO L93 Difference]: Finished difference Result 252 states and 596 transitions. [2020-10-16 13:21:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:21:42,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-16 13:21:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:42,569 INFO L225 Difference]: With dead ends: 252 [2020-10-16 13:21:42,569 INFO L226 Difference]: Without dead ends: 79 [2020-10-16 13:21:42,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:21:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-16 13:21:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-16 13:21:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-16 13:21:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-10-16 13:21:42,574 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-10-16 13:21:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:42,574 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-10-16 13:21:42,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:21:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-10-16 13:21:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 13:21:42,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:42,575 INFO L422 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] [2020-10-16 13:21:42,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:21:42,576 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1788376548, now seen corresponding path program 2 times [2020-10-16 13:21:42,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:42,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873669942] [2020-10-16 13:21:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:21:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 13:21:42,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873669942] [2020-10-16 13:21:42,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:21:42,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:21:42,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613867420] [2020-10-16 13:21:42,770 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:21:42,779 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:21:42,839 INFO L258 McrAutomatonBuilder]: Finished intersection with 122 states and 245 transitions. [2020-10-16 13:21:42,839 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:21:42,905 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:21:42,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,914 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,916 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,918 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:42,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:42,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:42,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:42,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:42,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:42,984 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:42,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,062 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,066 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,067 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:43,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:43,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:43,219 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,293 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,294 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 13:21:43,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:43,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:21:43,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-16 13:21:43,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:21:43,363 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,388 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:21:43,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-16 13:21:43,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,393 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:21:43,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 3, 1] term [2020-10-16 13:21:43,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,438 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,768 WARN L193 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 34 [2020-10-16 13:21:43,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:21:43,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-16 13:21:43,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:21:43,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,807 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 3, 1] term [2020-10-16 13:21:43,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,833 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,855 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:21:43,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,887 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-16 13:21:43,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,889 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:21:43,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 3, 1] term [2020-10-16 13:21:43,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:21:43,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:21:43,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-16 13:21:43,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:21:43,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,962 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-16 13:21:43,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:21:43,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 3, 1] term [2020-10-16 13:21:43,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:43,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:43,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,989 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:43,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:43,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-16 13:21:44,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-16 13:21:44,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-16 13:21:44,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:21:44,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,067 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 3, 2, 3, 1] term [2020-10-16 13:21:44,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:44,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:21:44,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,070 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:21:44,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:21:44,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:21:44,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-16 13:21:44,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:21:44,137 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [29620#(and (or (and (not (= ~z~0 0)) (= (mod ~z$w_buff1_used~0 256) 0) (not (= ~z$w_buff0_used~0 1)) (or (<= 0 (div ~z$w_buff1_used~0 256)) (= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (not (= ~z$w_buff0~0 0))))] [2020-10-16 13:21:44,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:21:44,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:21:44,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:21:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:21:44,138 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 6 states. [2020-10-16 13:21:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:21:44,224 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-10-16 13:21:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:21:44,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-16 13:21:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:21:44,225 INFO L225 Difference]: With dead ends: 97 [2020-10-16 13:21:44,225 INFO L226 Difference]: Without dead ends: 51 [2020-10-16 13:21:44,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:21:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-16 13:21:44,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-16 13:21:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-16 13:21:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-10-16 13:21:44,229 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-10-16 13:21:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:21:44,230 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-10-16 13:21:44,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:21:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-10-16 13:21:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-16 13:21:44,230 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:21:44,231 INFO L422 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] [2020-10-16 13:21:44,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:21:44,231 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:21:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:21:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1046254044, now seen corresponding path program 3 times [2020-10-16 13:21:44,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:21:44,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530808655] [2020-10-16 13:21:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:21:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:21:44,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:21:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:21:44,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:21:44,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:21:44,403 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:21:44,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:21:44,405 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:21:44,434 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L3-->L851: Formula: (let ((.cse6 (= (mod ~z$w_buff1_used~0_In554466316 256) 0)) (.cse7 (= (mod ~z$r_buff1_thd0~0_In554466316 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In554466316 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In554466316 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In554466316 0)) (or (and (= ~z$w_buff0_used~0_Out554466316 ~z$w_buff0_used~0_In554466316) .cse0) (and .cse1 (= ~z$w_buff0_used~0_Out554466316 0) .cse2)) (= ~z$r_buff0_thd0~0_Out554466316 ~z$r_buff0_thd0~0_In554466316) (or (and (= ~z~0_Out554466316 ~z$w_buff0~0_In554466316) .cse1 .cse2) (and (or (and (= ~z~0_Out554466316 ~z~0_In554466316) .cse3) (and .cse4 (= ~z~0_Out554466316 ~z$w_buff1~0_In554466316) .cse5)) .cse0)) (or (and (= ~z$w_buff1_used~0_Out554466316 ~z$w_buff1_used~0_In554466316) .cse3) (and (= ~z$w_buff1_used~0_Out554466316 0) .cse4 .cse5)) (= ~z$r_buff1_thd0~0_Out554466316 ~z$r_buff1_thd0~0_In554466316)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In554466316, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In554466316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In554466316, ~z$w_buff0~0=~z$w_buff0~0_In554466316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In554466316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In554466316, ~z$w_buff1~0=~z$w_buff1~0_In554466316, ~z~0=~z~0_In554466316} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out554466316, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out554466316|, ~z$w_buff0~0=~z$w_buff0~0_In554466316, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out554466316, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out554466316|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out554466316|, ~z$w_buff1~0=~z$w_buff1~0_In554466316, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out554466316|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out554466316|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out554466316, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out554466316|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In554466316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out554466316, ~z~0=~z~0_Out554466316} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-16 13:21:44,449 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,450 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,453 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,454 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,454 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,455 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,456 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,457 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,458 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,460 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,464 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 13:21:44,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:21:44,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:21:44 BasicIcfg [2020-10-16 13:21:44,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:21:44,553 INFO L168 Benchmark]: Toolchain (without parser) took 11759.80 ms. Allocated memory was 138.9 MB in the beginning and 378.5 MB in the end (delta: 239.6 MB). Free memory was 100.8 MB in the beginning and 35.6 MB in the end (delta: 65.2 MB). Peak memory consumption was 304.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,554 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 962.08 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 156.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,556 INFO L168 Benchmark]: Boogie Preprocessor took 44.11 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,557 INFO L168 Benchmark]: RCFGBuilder took 1862.01 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 151.9 MB in the beginning and 85.7 MB in the end (delta: 66.1 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,597 INFO L168 Benchmark]: TraceAbstraction took 8823.23 ms. Allocated memory was 234.9 MB in the beginning and 378.5 MB in the end (delta: 143.7 MB). Free memory was 85.7 MB in the beginning and 35.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 193.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:21:44,602 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 120.4 MB in the beginning and 120.0 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 962.08 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 156.9 MB in the end (delta: -56.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.9 MB in the beginning and 153.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.11 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1862.01 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 151.9 MB in the beginning and 85.7 MB in the end (delta: 66.1 MB). Peak memory consumption was 97.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8823.23 ms. Allocated memory was 234.9 MB in the beginning and 378.5 MB in the end (delta: 143.7 MB). Free memory was 85.7 MB in the beginning and 35.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 193.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1109 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 99 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.9s, 118 PlacesBefore, 43 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2248 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 4878 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1421; [L834] FCALL, FORK 0 pthread_create(&t1421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1422; [L836] FCALL, FORK 0 pthread_create(&t1422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1423; [L838] FCALL, FORK 0 pthread_create(&t1423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1424; [L840] FCALL, FORK 0 pthread_create(&t1424, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 4 z$w_buff1 = z$w_buff0 [L796] 4 z$w_buff0 = 1 [L797] 4 z$w_buff1_used = z$w_buff0_used [L798] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L800] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L801] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L802] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L803] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L804] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L805] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 3 z$flush_delayed = weak$$choice2 [L773] 3 z$mem_tmp = z [L774] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L775] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] 3 __unbuffered_p2_EAX = z [L782] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L782] 3 z = z$flush_delayed ? z$mem_tmp : z [L783] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 280 SDtfs, 369 SDslu, 393 SDs, 0 SdLazy, 122 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 243 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 138 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 13485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...