/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:03:44,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:03:44,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:03:44,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:03:44,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:03:44,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:03:44,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:03:44,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:03:44,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:03:44,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:03:44,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:03:44,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:03:44,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:03:44,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:03:44,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:03:44,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:03:44,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:03:44,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:03:44,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:03:44,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:03:44,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:03:44,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:03:44,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:03:44,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:03:44,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:03:44,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:03:44,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:03:44,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:03:44,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:03:44,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:03:44,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:03:44,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:03:44,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:03:44,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:03:44,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:03:44,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:03:44,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:03:44,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:03:44,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:03:44,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:03:44,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:03:44,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:03:44,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:03:44,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:03:44,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:03:44,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:03:44,492 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:03:44,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:03:44,493 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:03:44,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:03:44,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:03:44,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:03:44,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:03:44,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:03:44,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:03:44,495 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:03:44,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:03:44,496 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:03:44,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:03:44,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:03:44,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:03:44,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:03:44,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:03:44,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:03:44,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:03:44,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:03:44,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:03:44,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:03:44,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:03:44,498 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:03:44,498 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:03:44,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:03:44,499 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:03:44,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:03:44,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:03:44,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:03:44,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:03:44,840 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:03:44,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-22 02:03:44,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5682dc5a/282a3795f3d046c6834cf154ee3c0810/FLAG2d673683a [2020-10-22 02:03:45,385 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:03:45,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2020-10-22 02:03:45,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5682dc5a/282a3795f3d046c6834cf154ee3c0810/FLAG2d673683a [2020-10-22 02:03:45,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5682dc5a/282a3795f3d046c6834cf154ee3c0810 [2020-10-22 02:03:45,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:03:45,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:03:45,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:03:45,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:03:45,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:03:45,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:03:45" (1/1) ... [2020-10-22 02:03:45,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bf2dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:45, skipping insertion in model container [2020-10-22 02:03:45,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:03:45" (1/1) ... [2020-10-22 02:03:45,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:03:45,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:03:46,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:03:46,471 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:03:46,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:03:46,607 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:03:46,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46 WrapperNode [2020-10-22 02:03:46,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:03:46,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:03:46,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:03:46,609 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:03:46,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,638 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:03:46,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:03:46,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:03:46,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:03:46,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... [2020-10-22 02:03:46,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:03:46,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:03:46,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:03:46,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:03:46,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:03:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:03:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:03:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:03:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:03:46,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:03:46,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:03:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:03:46,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:03:46,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:03:46,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:03:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 02:03:46,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 02:03:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:03:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:03:46,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:03:46,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:03:46,803 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:03:48,706 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:03:48,707 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:03:48,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:03:48 BoogieIcfgContainer [2020-10-22 02:03:48,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:03:48,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:03:48,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:03:48,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:03:48,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:03:45" (1/3) ... [2020-10-22 02:03:48,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a61929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:03:48, skipping insertion in model container [2020-10-22 02:03:48,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:03:46" (2/3) ... [2020-10-22 02:03:48,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46a61929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:03:48, skipping insertion in model container [2020-10-22 02:03:48,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:03:48" (3/3) ... [2020-10-22 02:03:48,718 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-10-22 02:03:48,730 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:03:48,730 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:03:48,738 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:03:48,739 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:03:48,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,770 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,775 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,776 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,776 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,776 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,776 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,777 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,777 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,784 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,786 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,786 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,787 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:03:48,798 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:03:48,811 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 02:03:48,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:03:48,833 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:03:48,833 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:03:48,834 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:03:48,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:03:48,834 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:03:48,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:03:48,834 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:03:48,848 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:03:48,849 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:48,852 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:48,854 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-10-22 02:03:48,908 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-10-22 02:03:48,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:03:48,914 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-22 02:03:48,918 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-22 02:03:49,605 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 02:03:51,023 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-22 02:03:52,164 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-22 02:03:52,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-22 02:03:52,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:52,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:52,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:53,213 WARN L193 SmtUtils]: Spent 959.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 109 [2020-10-22 02:03:54,280 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2020-10-22 02:03:54,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-22 02:03:54,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:54,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:54,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:55,307 WARN L193 SmtUtils]: Spent 986.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-10-22 02:03:55,981 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-10-22 02:03:56,177 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-22 02:03:58,143 WARN L193 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 247 DAG size of output: 206 [2020-10-22 02:03:58,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 02:03:58,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:58,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:03:58,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:03:59,928 WARN L193 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 163 DAG size of output: 134 [2020-10-22 02:03:59,980 INFO L131 LiptonReduction]: Checked pairs total: 7247 [2020-10-22 02:03:59,980 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-22 02:03:59,988 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-22 02:04:00,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-22 02:04:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-22 02:04:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:04:00,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:00,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:00,184 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-22 02:04:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:00,190 INFO L82 PathProgramCache]: Analyzing trace with hash 477405012, now seen corresponding path program 1 times [2020-10-22 02:04:00,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:00,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296137372] [2020-10-22 02:04:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:00,530 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-22 02:04:00,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296137372] [2020-10-22 02:04:00,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:00,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:04:00,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889223676] [2020-10-22 02:04:00,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:00,537 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:00,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:04:00,552 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:00,557 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:00,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:00,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:00,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:00,577 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-22 02:04:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:00,679 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-22 02:04:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:00,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:04:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:00,721 INFO L225 Difference]: With dead ends: 2202 [2020-10-22 02:04:00,721 INFO L226 Difference]: Without dead ends: 1802 [2020-10-22 02:04:00,723 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-22 02:04:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-22 02:04:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-22 02:04:00,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-22 02:04:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-22 02:04:00,940 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-22 02:04:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:00,941 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-22 02:04:00,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-22 02:04:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:04:00,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:00,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:00,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:04:00,948 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-22 02:04:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -775206985, now seen corresponding path program 1 times [2020-10-22 02:04:00,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:00,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714724781] [2020-10-22 02:04:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:01,100 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-22 02:04:01,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714724781] [2020-10-22 02:04:01,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:01,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:04:01,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738305042] [2020-10-22 02:04:01,101 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:01,103 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:01,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:04:01,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:01,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:01,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:01,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:01,109 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-22 02:04:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:01,146 INFO L93 Difference]: Finished difference Result 1762 states and 6602 transitions. [2020-10-22 02:04:01,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:01,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 02:04:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:01,165 INFO L225 Difference]: With dead ends: 1762 [2020-10-22 02:04:01,165 INFO L226 Difference]: Without dead ends: 1762 [2020-10-22 02:04:01,166 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-22 02:04:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-22 02:04:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-22 02:04:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-22 02:04:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6602 transitions. [2020-10-22 02:04:01,300 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6602 transitions. Word has length 11 [2020-10-22 02:04:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:01,301 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6602 transitions. [2020-10-22 02:04:01,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6602 transitions. [2020-10-22 02:04:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:04:01,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:01,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:01,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:04:01,305 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-22 02:04:01,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1738386307, now seen corresponding path program 1 times [2020-10-22 02:04:01,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:01,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732782893] [2020-10-22 02:04:01,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:01,394 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-22 02:04:01,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732782893] [2020-10-22 02:04:01,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:01,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:04:01,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456683741] [2020-10-22 02:04:01,395 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:01,397 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:01,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-22 02:04:01,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:01,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:01,534 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:01,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:01,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:01,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:01,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:01,535 INFO L87 Difference]: Start difference. First operand 1762 states and 6602 transitions. Second operand 3 states. [2020-10-22 02:04:01,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:01,602 INFO L93 Difference]: Finished difference Result 1754 states and 6564 transitions. [2020-10-22 02:04:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:01,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:04:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:01,620 INFO L225 Difference]: With dead ends: 1754 [2020-10-22 02:04:01,620 INFO L226 Difference]: Without dead ends: 1754 [2020-10-22 02:04:01,620 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-22 02:04:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2020-10-22 02:04:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2020-10-22 02:04:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2020-10-22 02:04:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 6564 transitions. [2020-10-22 02:04:01,696 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 6564 transitions. Word has length 12 [2020-10-22 02:04:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:01,697 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 6564 transitions. [2020-10-22 02:04:01,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 6564 transitions. [2020-10-22 02:04:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:04:01,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:01,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:01,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:04:01,703 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-22 02:04:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:01,704 INFO L82 PathProgramCache]: Analyzing trace with hash -709915685, now seen corresponding path program 1 times [2020-10-22 02:04:01,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:01,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227830653] [2020-10-22 02:04:01,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:01,848 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-22 02:04:01,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227830653] [2020-10-22 02:04:01,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:01,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:04:01,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146468357] [2020-10-22 02:04:01,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:01,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:01,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-10-22 02:04:01,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:02,106 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:02,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:04:02,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:02,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:04:02,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:02,107 INFO L87 Difference]: Start difference. First operand 1754 states and 6564 transitions. Second operand 4 states. [2020-10-22 02:04:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:02,189 INFO L93 Difference]: Finished difference Result 1938 states and 7170 transitions. [2020-10-22 02:04:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:02,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:04:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:02,207 INFO L225 Difference]: With dead ends: 1938 [2020-10-22 02:04:02,208 INFO L226 Difference]: Without dead ends: 1938 [2020-10-22 02:04:02,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2020-10-22 02:04:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1906. [2020-10-22 02:04:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2020-10-22 02:04:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 7074 transitions. [2020-10-22 02:04:02,283 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 7074 transitions. Word has length 13 [2020-10-22 02:04:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:02,283 INFO L481 AbstractCegarLoop]: Abstraction has 1906 states and 7074 transitions. [2020-10-22 02:04:02,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:04:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 7074 transitions. [2020-10-22 02:04:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:04:02,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:02,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:02,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:04:02,286 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-22 02:04:02,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1037055385, now seen corresponding path program 1 times [2020-10-22 02:04:02,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:02,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468978637] [2020-10-22 02:04:02,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:02,440 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-22 02:04:02,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468978637] [2020-10-22 02:04:02,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:02,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:04:02,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234051678] [2020-10-22 02:04:02,442 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:02,444 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:02,449 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 47 transitions. [2020-10-22 02:04:02,449 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:02,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:04:02,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:02,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:02,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:02,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:02,486 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:02,515 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,552 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:02,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:02,949 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:02,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:04:02,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:04:02,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:02,951 INFO L87 Difference]: Start difference. First operand 1906 states and 7074 transitions. Second operand 4 states. [2020-10-22 02:04:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:03,023 INFO L93 Difference]: Finished difference Result 1850 states and 6840 transitions. [2020-10-22 02:04:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:03,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:04:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:03,041 INFO L225 Difference]: With dead ends: 1850 [2020-10-22 02:04:03,041 INFO L226 Difference]: Without dead ends: 1850 [2020-10-22 02:04:03,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-10-22 02:04:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1690. [2020-10-22 02:04:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2020-10-22 02:04:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 6296 transitions. [2020-10-22 02:04:03,166 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 6296 transitions. Word has length 13 [2020-10-22 02:04:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:03,167 INFO L481 AbstractCegarLoop]: Abstraction has 1690 states and 6296 transitions. [2020-10-22 02:04:03,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:04:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 6296 transitions. [2020-10-22 02:04:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:04:03,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:03,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:03,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:04:03,169 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-22 02:04:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:03,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1988560249, now seen corresponding path program 1 times [2020-10-22 02:04:03,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:03,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324963491] [2020-10-22 02:04:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:03,303 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-22 02:04:03,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324963491] [2020-10-22 02:04:03,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:03,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:03,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963372889] [2020-10-22 02:04:03,305 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:03,308 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:03,313 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-10-22 02:04:03,313 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:03,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 1] term [2020-10-22 02:04:03,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:03,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 02:04:03,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:03,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:03,350 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:03,357 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:03,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:03,367 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:03,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:03,379 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:03,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [32689#(and (= ~x~0 0) (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0))), 32690#(and (= ~x~0 0) (= (mod ~z$r_buff0_thd0~0 256) 0) (not (= 2 ~z~0)))] [2020-10-22 02:04:03,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:04:03,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:04:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:03,611 INFO L87 Difference]: Start difference. First operand 1690 states and 6296 transitions. Second operand 7 states. [2020-10-22 02:04:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:03,677 INFO L93 Difference]: Finished difference Result 1682 states and 6256 transitions. [2020-10-22 02:04:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:03,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-22 02:04:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:03,692 INFO L225 Difference]: With dead ends: 1682 [2020-10-22 02:04:03,692 INFO L226 Difference]: Without dead ends: 1682 [2020-10-22 02:04:03,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:03,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2020-10-22 02:04:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1682. [2020-10-22 02:04:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2020-10-22 02:04:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 6256 transitions. [2020-10-22 02:04:03,752 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 6256 transitions. Word has length 13 [2020-10-22 02:04:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:03,752 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 6256 transitions. [2020-10-22 02:04:03,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:04:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 6256 transitions. [2020-10-22 02:04:03,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:04:03,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:03,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:03,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:04:03,755 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-22 02:04:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:03,756 INFO L82 PathProgramCache]: Analyzing trace with hash -533968753, now seen corresponding path program 1 times [2020-10-22 02:04:03,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:03,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345747678] [2020-10-22 02:04:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:03,793 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-22 02:04:03,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345747678] [2020-10-22 02:04:03,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:03,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:04:03,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1628198459] [2020-10-22 02:04:03,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:03,797 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:03,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2020-10-22 02:04:03,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:03,837 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:03,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:03,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:03,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:03,839 INFO L87 Difference]: Start difference. First operand 1682 states and 6256 transitions. Second operand 3 states. [2020-10-22 02:04:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:03,864 INFO L93 Difference]: Finished difference Result 2322 states and 8336 transitions. [2020-10-22 02:04:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:03,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-22 02:04:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:03,880 INFO L225 Difference]: With dead ends: 2322 [2020-10-22 02:04:03,880 INFO L226 Difference]: Without dead ends: 1778 [2020-10-22 02:04:03,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-22 02:04:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2020-10-22 02:04:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1650. [2020-10-22 02:04:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2020-10-22 02:04:03,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 5856 transitions. [2020-10-22 02:04:03,934 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 5856 transitions. Word has length 14 [2020-10-22 02:04:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:03,935 INFO L481 AbstractCegarLoop]: Abstraction has 1650 states and 5856 transitions. [2020-10-22 02:04:03,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 5856 transitions. [2020-10-22 02:04:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:04:03,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:03,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:03,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:04:03,938 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-22 02:04:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2127906781, now seen corresponding path program 1 times [2020-10-22 02:04:03,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:03,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413748714] [2020-10-22 02:04:03,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:04,035 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-22 02:04:04,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413748714] [2020-10-22 02:04:04,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:04,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:04,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451891808] [2020-10-22 02:04:04,036 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:04,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:04,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 67 transitions. [2020-10-22 02:04:04,045 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:04,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:04:04,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:04,072 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:04,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:04,077 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:04,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,096 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:04:04,109 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:04:04,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:04:04,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:04,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:04,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:04,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:04,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:04,767 INFO L87 Difference]: Start difference. First operand 1650 states and 5856 transitions. Second operand 5 states. [2020-10-22 02:04:04,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:04,862 INFO L93 Difference]: Finished difference Result 1786 states and 6264 transitions. [2020-10-22 02:04:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:04,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 02:04:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:04,875 INFO L225 Difference]: With dead ends: 1786 [2020-10-22 02:04:04,875 INFO L226 Difference]: Without dead ends: 1786 [2020-10-22 02:04:04,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:04:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2020-10-22 02:04:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2020-10-22 02:04:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-10-22 02:04:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6264 transitions. [2020-10-22 02:04:04,929 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6264 transitions. Word has length 14 [2020-10-22 02:04:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:04,929 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6264 transitions. [2020-10-22 02:04:04,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6264 transitions. [2020-10-22 02:04:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:04:04,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:04,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:04,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:04:04,933 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-22 02:04:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash 176244774, now seen corresponding path program 1 times [2020-10-22 02:04:04,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:04,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9874647] [2020-10-22 02:04:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:04,980 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-22 02:04:04,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9874647] [2020-10-22 02:04:04,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:04,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:04:04,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [507736493] [2020-10-22 02:04:04,981 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:04,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:04,988 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 44 transitions. [2020-10-22 02:04:04,989 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:05,210 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:05,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:05,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:05,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:05,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:05,212 INFO L87 Difference]: Start difference. First operand 1786 states and 6264 transitions. Second operand 3 states. [2020-10-22 02:04:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:05,228 INFO L93 Difference]: Finished difference Result 1762 states and 6160 transitions. [2020-10-22 02:04:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:05,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-22 02:04:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:05,235 INFO L225 Difference]: With dead ends: 1762 [2020-10-22 02:04:05,235 INFO L226 Difference]: Without dead ends: 1762 [2020-10-22 02:04:05,236 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-22 02:04:05,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2020-10-22 02:04:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1762. [2020-10-22 02:04:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2020-10-22 02:04:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 6160 transitions. [2020-10-22 02:04:05,287 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 6160 transitions. Word has length 15 [2020-10-22 02:04:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:05,287 INFO L481 AbstractCegarLoop]: Abstraction has 1762 states and 6160 transitions. [2020-10-22 02:04:05,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 6160 transitions. [2020-10-22 02:04:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 02:04:05,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:05,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:05,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:04:05,292 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-22 02:04:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:05,292 INFO L82 PathProgramCache]: Analyzing trace with hash -591786302, now seen corresponding path program 1 times [2020-10-22 02:04:05,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:05,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575040912] [2020-10-22 02:04:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:05,376 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-22 02:04:05,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575040912] [2020-10-22 02:04:05,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:05,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:05,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339652166] [2020-10-22 02:04:05,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:05,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:05,389 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 107 transitions. [2020-10-22 02:04:05,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:05,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:05,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:06,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [54020#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-22 02:04:06,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:04:06,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:04:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:04:06,179 INFO L87 Difference]: Start difference. First operand 1762 states and 6160 transitions. Second operand 5 states. [2020-10-22 02:04:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:06,274 INFO L93 Difference]: Finished difference Result 1399 states and 4355 transitions. [2020-10-22 02:04:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:04:06,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-22 02:04:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:06,278 INFO L225 Difference]: With dead ends: 1399 [2020-10-22 02:04:06,278 INFO L226 Difference]: Without dead ends: 935 [2020-10-22 02:04:06,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-10-22 02:04:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 935. [2020-10-22 02:04:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2020-10-22 02:04:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2659 transitions. [2020-10-22 02:04:06,301 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2659 transitions. Word has length 16 [2020-10-22 02:04:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:06,301 INFO L481 AbstractCegarLoop]: Abstraction has 935 states and 2659 transitions. [2020-10-22 02:04:06,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:04:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2659 transitions. [2020-10-22 02:04:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:04:06,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:06,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:06,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:04:06,305 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-22 02:04:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:06,305 INFO L82 PathProgramCache]: Analyzing trace with hash -232445824, now seen corresponding path program 1 times [2020-10-22 02:04:06,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:06,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21181640] [2020-10-22 02:04:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:06,418 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-22 02:04:06,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21181640] [2020-10-22 02:04:06,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:06,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:04:06,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118397956] [2020-10-22 02:04:06,419 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:06,422 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:06,438 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 130 transitions. [2020-10-22 02:04:06,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:07,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:07,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:04:07,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:07,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:04:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:04:07,020 INFO L87 Difference]: Start difference. First operand 935 states and 2659 transitions. Second operand 4 states. [2020-10-22 02:04:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:07,050 INFO L93 Difference]: Finished difference Result 1286 states and 3570 transitions. [2020-10-22 02:04:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:04:07,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:04:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:07,055 INFO L225 Difference]: With dead ends: 1286 [2020-10-22 02:04:07,055 INFO L226 Difference]: Without dead ends: 832 [2020-10-22 02:04:07,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-22 02:04:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2020-10-22 02:04:07,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 811. [2020-10-22 02:04:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-10-22 02:04:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2173 transitions. [2020-10-22 02:04:07,075 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2173 transitions. Word has length 19 [2020-10-22 02:04:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:07,075 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 2173 transitions. [2020-10-22 02:04:07,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:04:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2173 transitions. [2020-10-22 02:04:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:04:07,077 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:07,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:07,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:04:07,078 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:07,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:07,078 INFO L82 PathProgramCache]: Analyzing trace with hash 586023615, now seen corresponding path program 1 times [2020-10-22 02:04:07,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:07,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742860126] [2020-10-22 02:04:07,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:07,120 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-22 02:04:07,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742860126] [2020-10-22 02:04:07,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:07,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:04:07,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713139611] [2020-10-22 02:04:07,122 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:07,124 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:07,140 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 145 transitions. [2020-10-22 02:04:07,140 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:07,535 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:04:07,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:04:07,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:07,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:04:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:04:07,536 INFO L87 Difference]: Start difference. First operand 811 states and 2173 transitions. Second operand 3 states. [2020-10-22 02:04:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:07,552 INFO L93 Difference]: Finished difference Result 1111 states and 2854 transitions. [2020-10-22 02:04:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:04:07,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-22 02:04:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:07,556 INFO L225 Difference]: With dead ends: 1111 [2020-10-22 02:04:07,556 INFO L226 Difference]: Without dead ends: 795 [2020-10-22 02:04:07,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-22 02:04:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2020-10-22 02:04:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 771. [2020-10-22 02:04:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-10-22 02:04:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1940 transitions. [2020-10-22 02:04:07,576 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1940 transitions. Word has length 19 [2020-10-22 02:04:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:07,576 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 1940 transitions. [2020-10-22 02:04:07,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:04:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1940 transitions. [2020-10-22 02:04:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:04:07,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:07,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:04:07,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:04:07,579 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:07,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash 106051531, now seen corresponding path program 1 times [2020-10-22 02:04:07,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:07,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51332053] [2020-10-22 02:04:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:07,669 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-22 02:04:07,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51332053] [2020-10-22 02:04:07,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:07,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:04:07,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [713488538] [2020-10-22 02:04:07,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:07,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:07,688 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 102 transitions. [2020-10-22 02:04:07,688 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:07,992 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [62871#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:04:07,992 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:04:07,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:07,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:04:07,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:04:07,993 INFO L87 Difference]: Start difference. First operand 771 states and 1940 transitions. Second operand 7 states. [2020-10-22 02:04:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:08,065 INFO L93 Difference]: Finished difference Result 672 states and 1643 transitions. [2020-10-22 02:04:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:04:08,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 02:04:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:08,068 INFO L225 Difference]: With dead ends: 672 [2020-10-22 02:04:08,068 INFO L226 Difference]: Without dead ends: 458 [2020-10-22 02:04:08,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:04:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-22 02:04:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 432. [2020-10-22 02:04:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-22 02:04:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1005 transitions. [2020-10-22 02:04:08,079 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1005 transitions. Word has length 19 [2020-10-22 02:04:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:08,079 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1005 transitions. [2020-10-22 02:04:08,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:04:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1005 transitions. [2020-10-22 02:04:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:04:08,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:08,081 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] [2020-10-22 02:04:08,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:04:08,081 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1722088816, now seen corresponding path program 1 times [2020-10-22 02:04:08,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:08,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322335510] [2020-10-22 02:04:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:08,296 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-22 02:04:08,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322335510] [2020-10-22 02:04:08,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:08,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:04:08,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793760540] [2020-10-22 02:04:08,297 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:08,301 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:08,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 209 states and 484 transitions. [2020-10-22 02:04:08,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:08,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term [2020-10-22 02:04:08,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-22 02:04:08,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:04:08,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 5, 1] term [2020-10-22 02:04:08,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:08,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:08,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:04:08,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:04:08,390 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:04:08,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:08,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:04:08,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:04:08,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:08,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:04:08,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:08,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:08,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:04:08,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 02:04:08,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:04:08,598 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-10-22 02:04:10,788 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [64417#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 64418#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~z~0)))), 64419#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0) (not (= 2 ~z~0)))), 64420#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd3~0 256) 0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 64421#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= (mod ~z$r_buff0_thd3~0 256) 0) (= ~z$w_buff0_used~0 0))), 64422#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)))] [2020-10-22 02:04:10,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 02:04:10,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:10,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 02:04:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:04:10,790 INFO L87 Difference]: Start difference. First operand 432 states and 1005 transitions. Second operand 13 states. [2020-10-22 02:04:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:11,110 INFO L93 Difference]: Finished difference Result 563 states and 1280 transitions. [2020-10-22 02:04:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:04:11,110 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-10-22 02:04:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:11,111 INFO L225 Difference]: With dead ends: 563 [2020-10-22 02:04:11,111 INFO L226 Difference]: Without dead ends: 325 [2020-10-22 02:04:11,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-10-22 02:04:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-10-22 02:04:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 296. [2020-10-22 02:04:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-10-22 02:04:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 646 transitions. [2020-10-22 02:04:11,122 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 646 transitions. Word has length 22 [2020-10-22 02:04:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:11,123 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 646 transitions. [2020-10-22 02:04:11,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 02:04:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 646 transitions. [2020-10-22 02:04:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:04:11,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:11,125 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] [2020-10-22 02:04:11,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:04:11,126 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2144444351, now seen corresponding path program 1 times [2020-10-22 02:04:11,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:11,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521023395] [2020-10-22 02:04:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:04:11,289 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-22 02:04:11,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521023395] [2020-10-22 02:04:11,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:04:11,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:04:11,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525120490] [2020-10-22 02:04:11,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:04:11,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:04:11,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 126 transitions. [2020-10-22 02:04:11,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:04:11,550 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [65593#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:04:11,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:04:11,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:04:11,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:04:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:04:11,551 INFO L87 Difference]: Start difference. First operand 296 states and 646 transitions. Second operand 8 states. [2020-10-22 02:04:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:04:11,631 INFO L93 Difference]: Finished difference Result 276 states and 607 transitions. [2020-10-22 02:04:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:04:11,632 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 02:04:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:04:11,632 INFO L225 Difference]: With dead ends: 276 [2020-10-22 02:04:11,632 INFO L226 Difference]: Without dead ends: 63 [2020-10-22 02:04:11,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:04:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-22 02:04:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-22 02:04:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 02:04:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2020-10-22 02:04:11,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 22 [2020-10-22 02:04:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:04:11,635 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2020-10-22 02:04:11,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:04:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2020-10-22 02:04:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 02:04:11,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:04:11,636 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, 1] [2020-10-22 02:04:11,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:04:11,636 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:04:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:04:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash 81887815, now seen corresponding path program 1 times [2020-10-22 02:04:11,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:04:11,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401091505] [2020-10-22 02:04:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:04:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:04:11,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:04:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:04:11,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:04:11,756 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:04:11,756 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:04:11,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 02:04:11,757 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:04:11,772 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L3-->L852: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In1744048728 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In1744048728 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1744048728 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1744048728 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_In1744048728 ~z$r_buff0_thd0~0_Out1744048728) (or (and (= ~z$w_buff1_used~0_Out1744048728 0) .cse0 .cse1) (and (= ~z$w_buff1_used~0_Out1744048728 ~z$w_buff1_used~0_In1744048728) .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1744048728 0)) (or (and (or (and (= ~z$w_buff1~0_In1744048728 ~z~0_Out1744048728) .cse0 .cse1) (and (= ~z~0_In1744048728 ~z~0_Out1744048728) .cse2)) .cse3) (and .cse4 .cse5 (= ~z~0_Out1744048728 ~z$w_buff0~0_In1744048728))) (or (and .cse4 (= ~z$w_buff0_used~0_Out1744048728 0) .cse5) (and (= ~z$w_buff0_used~0_In1744048728 ~z$w_buff0_used~0_Out1744048728) .cse3)) (= ~z$r_buff1_thd0~0_Out1744048728 ~z$r_buff1_thd0~0_In1744048728)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1744048728, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1744048728, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1744048728, ~z$w_buff0~0=~z$w_buff0~0_In1744048728, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1744048728, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1744048728, ~z$w_buff1~0=~z$w_buff1~0_In1744048728, ~z~0=~z~0_In1744048728} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1744048728, ~z$w_buff0~0=~z$w_buff0~0_In1744048728, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1744048728, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1744048728|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1744048728|, ~z$w_buff1~0=~z$w_buff1~0_In1744048728, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1744048728|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1744048728|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1744048728|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1744048728|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1744048728, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1744048728, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1744048728, ~z~0=~z~0_Out1744048728} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-22 02:04:11,779 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-22 02:04:11,780 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-10-22 02:04:11,782 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-22 02:04:11,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,782 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-22 02:04:11,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,782 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-22 02:04:11,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,783 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-22 02:04:11,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,783 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-22 02:04:11,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,784 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-22 02:04:11,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,784 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-22 02:04:11,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,784 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-22 02:04:11,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,785 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-22 02:04:11,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,785 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-22 02:04:11,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,786 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-22 02:04:11,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,786 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-22 02:04:11,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,787 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-22 02:04:11,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,787 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-22 02:04:11,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,787 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-22 02:04:11,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,788 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-22 02:04:11,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,788 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-22 02:04:11,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,788 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-22 02:04:11,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,789 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-22 02:04:11,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,789 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-22 02:04:11,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,789 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-22 02:04:11,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,790 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-22 02:04:11,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,790 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-22 02:04:11,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:04:11,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:04:11 BasicIcfg [2020-10-22 02:04:11,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:04:11,868 INFO L168 Benchmark]: Toolchain (without parser) took 26116.48 ms. Allocated memory was 148.9 MB in the beginning and 461.4 MB in the end (delta: 312.5 MB). Free memory was 103.6 MB in the beginning and 167.5 MB in the end (delta: -63.8 MB). Peak memory consumption was 248.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,868 INFO L168 Benchmark]: CDTParser took 3.16 ms. Allocated memory is still 148.9 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.20 ms. Allocated memory was 148.9 MB in the beginning and 205.5 MB in the end (delta: 56.6 MB). Free memory was 102.6 MB in the beginning and 155.5 MB in the end (delta: -52.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 205.5 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,870 INFO L168 Benchmark]: Boogie Preprocessor took 40.89 ms. Allocated memory is still 205.5 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,871 INFO L168 Benchmark]: RCFGBuilder took 1988.96 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 150.4 MB in the beginning and 158.1 MB in the end (delta: -7.8 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,872 INFO L168 Benchmark]: TraceAbstraction took 23155.57 ms. Allocated memory was 244.3 MB in the beginning and 461.4 MB in the end (delta: 217.1 MB). Free memory was 158.1 MB in the beginning and 167.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 207.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:04:11,875 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.16 ms. Allocated memory is still 148.9 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 850.20 ms. Allocated memory was 148.9 MB in the beginning and 205.5 MB in the end (delta: 56.6 MB). Free memory was 102.6 MB in the beginning and 155.5 MB in the end (delta: -52.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 205.5 MB. Free memory was 155.5 MB in the beginning and 152.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.89 ms. Allocated memory is still 205.5 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1988.96 ms. Allocated memory was 205.5 MB in the beginning and 244.3 MB in the end (delta: 38.8 MB). Free memory was 150.4 MB in the beginning and 158.1 MB in the end (delta: -7.8 MB). Peak memory consumption was 91.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23155.57 ms. Allocated memory was 244.3 MB in the beginning and 461.4 MB in the end (delta: 217.1 MB). Free memory was 158.1 MB in the beginning and 167.5 MB in the end (delta: -9.3 MB). Peak memory consumption was 207.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1396 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 105 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.1s, 126 PlacesBefore, 44 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 7247 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1541; [L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L836] 0 pthread_t t1542; [L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L838] 0 pthread_t t1543; [L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L840] 0 pthread_t t1544; [L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 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) [L812] 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) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 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 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 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 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.3s, HoareTripleCheckerStatistics: 443 SDtfs, 499 SDslu, 614 SDs, 0 SdLazy, 261 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 337 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 420 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 19933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...