/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:09:26,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:09:26,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:09:26,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:09:26,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:09:26,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:09:26,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:09:26,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:09:26,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:09:26,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:09:26,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:09:26,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:09:26,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:09:26,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:09:26,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:09:26,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:09:26,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:09:26,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:09:26,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:09:26,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:09:26,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:09:26,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:09:26,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:09:26,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:09:26,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:09:26,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:09:26,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:09:26,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:09:26,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:09:26,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:09:26,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:09:26,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:09:26,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:09:26,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:09:26,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:09:26,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:09:26,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:09:26,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:09:26,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:09:26,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:09:26,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:09:26,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:09:26,727 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:09:26,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:09:26,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:09:26,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:09:26,730 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:09:26,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:09:26,731 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:09:26,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:09:26,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:09:26,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:09:26,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:09:26,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:09:26,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:09:26,733 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:09:26,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:09:26,734 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:09:26,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:09:26,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:09:26,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:09:26,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:09:26,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:09:26,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:09:26,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:09:26,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:09:26,735 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:09:26,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:09:26,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:09:26,736 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:09:26,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:09:27,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:09:27,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:09:27,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:09:27,055 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:09:27,056 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:09:27,056 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-16 12:09:27,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c30dc3bd3/5948a24ead5d433c8a567e72101de458/FLAG93286eb02 [2020-10-16 12:09:27,728 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:09:27,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2020-10-16 12:09:27,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c30dc3bd3/5948a24ead5d433c8a567e72101de458/FLAG93286eb02 [2020-10-16 12:09:27,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c30dc3bd3/5948a24ead5d433c8a567e72101de458 [2020-10-16 12:09:27,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:09:27,969 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:09:27,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:09:27,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:09:27,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:09:27,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:09:27" (1/1) ... [2020-10-16 12:09:27,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e3b10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:27, skipping insertion in model container [2020-10-16 12:09:27,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:09:27" (1/1) ... [2020-10-16 12:09:27,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:09:28,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:09:28,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:09:28,639 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:09:28,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:09:28,784 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:09:28,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28 WrapperNode [2020-10-16 12:09:28,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:09:28,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:09:28,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:09:28,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:09:28,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:09:28,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:09:28,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:09:28,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:09:28,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... [2020-10-16 12:09:28,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:09:28,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:09:28,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:09:28,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:09:28,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:09:28,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:09:28,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:09:28,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:09:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:09:28,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:09:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:09:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:09:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:09:28,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:09:28,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:09:28,978 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:09:31,040 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:09:31,040 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:09:31,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:09:31 BoogieIcfgContainer [2020-10-16 12:09:31,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:09:31,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:09:31,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:09:31,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:09:31,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:09:27" (1/3) ... [2020-10-16 12:09:31,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e44e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:09:31, skipping insertion in model container [2020-10-16 12:09:31,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:09:28" (2/3) ... [2020-10-16 12:09:31,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e44e4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:09:31, skipping insertion in model container [2020-10-16 12:09:31,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:09:31" (3/3) ... [2020-10-16 12:09:31,053 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2020-10-16 12:09:31,067 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:09:31,067 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:09:31,077 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:09:31,078 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:09:31,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,118 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,118 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,119 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,130 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,134 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:09:31,137 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:09:31,152 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:09:31,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:09:31,177 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:09:31,177 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:09:31,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:09:31,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:09:31,177 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:09:31,178 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:09:31,178 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:09:31,194 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:09:31,195 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:31,199 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:31,201 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-16 12:09:31,251 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-16 12:09:31,251 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:09:31,257 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:09:31,260 INFO L117 LiptonReduction]: Number of co-enabled transitions 1560 [2020-10-16 12:09:32,034 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:09:32,672 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:09:34,648 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 12:09:34,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 12:09:34,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:34,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:09:34,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:35,823 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 12:09:36,243 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 12:09:37,926 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 12:09:37,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:09:37,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:37,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:09:37,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:09:39,277 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2020-10-16 12:09:39,309 INFO L132 LiptonReduction]: Checked pairs total: 4070 [2020-10-16 12:09:39,309 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 12:09:39,319 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:09:39,387 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 662 states. [2020-10-16 12:09:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states. [2020-10-16 12:09:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 12:09:39,396 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:39,397 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 12:09:39,398 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1035167, now seen corresponding path program 1 times [2020-10-16 12:09:39,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:39,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666411913] [2020-10-16 12:09:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:39,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666411913] [2020-10-16 12:09:39,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:39,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:39,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066609346] [2020-10-16 12:09:39,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:39,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:39,650 INFO L87 Difference]: Start difference. First operand 662 states. Second operand 3 states. [2020-10-16 12:09:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:39,816 INFO L93 Difference]: Finished difference Result 552 states and 1697 transitions. [2020-10-16 12:09:39,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:39,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 12:09:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:39,855 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:09:39,856 INFO L226 Difference]: Without dead ends: 452 [2020-10-16 12:09:39,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-16 12:09:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-16 12:09:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-16 12:09:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2020-10-16 12:09:40,012 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2020-10-16 12:09:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:40,013 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2020-10-16 12:09:40,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2020-10-16 12:09:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:09:40,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:40,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:40,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:09:40,017 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:40,018 INFO L82 PathProgramCache]: Analyzing trace with hash 793045883, now seen corresponding path program 1 times [2020-10-16 12:09:40,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:40,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260001094] [2020-10-16 12:09:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:40,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260001094] [2020-10-16 12:09:40,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:40,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:40,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82847647] [2020-10-16 12:09:40,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:40,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:40,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:40,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:40,205 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand 3 states. [2020-10-16 12:09:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:40,225 INFO L93 Difference]: Finished difference Result 442 states and 1324 transitions. [2020-10-16 12:09:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:40,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:09:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:40,231 INFO L225 Difference]: With dead ends: 442 [2020-10-16 12:09:40,231 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 12:09:40,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 12:09:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-16 12:09:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-16 12:09:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1324 transitions. [2020-10-16 12:09:40,253 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1324 transitions. Word has length 9 [2020-10-16 12:09:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:40,255 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1324 transitions. [2020-10-16 12:09:40,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1324 transitions. [2020-10-16 12:09:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:09:40,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:40,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:40,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:09:40,258 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1657178972, now seen corresponding path program 1 times [2020-10-16 12:09:40,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:40,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737601513] [2020-10-16 12:09:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:40,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737601513] [2020-10-16 12:09:40,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:40,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:09:40,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054981380] [2020-10-16 12:09:40,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:09:40,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:09:40,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:40,355 INFO L87 Difference]: Start difference. First operand 442 states and 1324 transitions. Second operand 3 states. [2020-10-16 12:09:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:40,368 INFO L93 Difference]: Finished difference Result 424 states and 1261 transitions. [2020-10-16 12:09:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:40,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:09:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:40,374 INFO L225 Difference]: With dead ends: 424 [2020-10-16 12:09:40,374 INFO L226 Difference]: Without dead ends: 424 [2020-10-16 12:09:40,374 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:09:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-16 12:09:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-10-16 12:09:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-16 12:09:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1261 transitions. [2020-10-16 12:09:40,429 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1261 transitions. Word has length 10 [2020-10-16 12:09:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:40,431 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1261 transitions. [2020-10-16 12:09:40,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:09:40,431 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1261 transitions. [2020-10-16 12:09:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:09:40,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:40,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:40,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:09:40,444 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:40,444 INFO L82 PathProgramCache]: Analyzing trace with hash 167058694, now seen corresponding path program 1 times [2020-10-16 12:09:40,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:40,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236826893] [2020-10-16 12:09:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:40,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236826893] [2020-10-16 12:09:40,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:40,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:09:40,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167607063] [2020-10-16 12:09:40,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:40,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:40,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:40,643 INFO L87 Difference]: Start difference. First operand 424 states and 1261 transitions. Second operand 4 states. [2020-10-16 12:09:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:40,704 INFO L93 Difference]: Finished difference Result 421 states and 1250 transitions. [2020-10-16 12:09:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:09:40,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:09:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:40,709 INFO L225 Difference]: With dead ends: 421 [2020-10-16 12:09:40,709 INFO L226 Difference]: Without dead ends: 421 [2020-10-16 12:09:40,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-16 12:09:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-16 12:09:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-16 12:09:40,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-16 12:09:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1250 transitions. [2020-10-16 12:09:40,725 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1250 transitions. Word has length 11 [2020-10-16 12:09:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:40,726 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1250 transitions. [2020-10-16 12:09:40,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1250 transitions. [2020-10-16 12:09:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:40,730 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:40,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:40,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:09:40,731 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1277010548, now seen corresponding path program 1 times [2020-10-16 12:09:40,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:40,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024621406] [2020-10-16 12:09:40,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:40,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024621406] [2020-10-16 12:09:40,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:40,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:40,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923310377] [2020-10-16 12:09:40,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:40,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:40,831 INFO L87 Difference]: Start difference. First operand 421 states and 1250 transitions. Second operand 4 states. [2020-10-16 12:09:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:40,870 INFO L93 Difference]: Finished difference Result 850 states and 2409 transitions. [2020-10-16 12:09:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:09:40,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:09:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:40,875 INFO L225 Difference]: With dead ends: 850 [2020-10-16 12:09:40,875 INFO L226 Difference]: Without dead ends: 445 [2020-10-16 12:09:40,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-16 12:09:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2020-10-16 12:09:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2020-10-16 12:09:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1149 transitions. [2020-10-16 12:09:40,889 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 1149 transitions. Word has length 12 [2020-10-16 12:09:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:40,889 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 1149 transitions. [2020-10-16 12:09:40,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 1149 transitions. [2020-10-16 12:09:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:40,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:40,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:40,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:09:40,891 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 185118520, now seen corresponding path program 1 times [2020-10-16 12:09:40,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:40,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379608285] [2020-10-16 12:09:40,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:40,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379608285] [2020-10-16 12:09:40,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:40,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:40,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457897878] [2020-10-16 12:09:40,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:40,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:40,981 INFO L87 Difference]: Start difference. First operand 409 states and 1149 transitions. Second operand 5 states. [2020-10-16 12:09:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:41,088 INFO L93 Difference]: Finished difference Result 423 states and 1173 transitions. [2020-10-16 12:09:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:41,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:09:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:41,094 INFO L225 Difference]: With dead ends: 423 [2020-10-16 12:09:41,094 INFO L226 Difference]: Without dead ends: 423 [2020-10-16 12:09:41,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-16 12:09:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2020-10-16 12:09:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-16 12:09:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1173 transitions. [2020-10-16 12:09:41,116 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1173 transitions. Word has length 12 [2020-10-16 12:09:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:41,116 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1173 transitions. [2020-10-16 12:09:41,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1173 transitions. [2020-10-16 12:09:41,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:41,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:41,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:41,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:09:41,119 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:41,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 883850748, now seen corresponding path program 1 times [2020-10-16 12:09:41,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:41,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490997947] [2020-10-16 12:09:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:41,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490997947] [2020-10-16 12:09:41,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:41,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:09:41,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976209984] [2020-10-16 12:09:41,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:41,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:41,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:41,217 INFO L87 Difference]: Start difference. First operand 423 states and 1173 transitions. Second operand 4 states. [2020-10-16 12:09:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:41,287 INFO L93 Difference]: Finished difference Result 431 states and 1198 transitions. [2020-10-16 12:09:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:41,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:09:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:41,294 INFO L225 Difference]: With dead ends: 431 [2020-10-16 12:09:41,294 INFO L226 Difference]: Without dead ends: 431 [2020-10-16 12:09:41,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-16 12:09:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-10-16 12:09:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 427. [2020-10-16 12:09:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-10-16 12:09:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1184 transitions. [2020-10-16 12:09:41,309 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1184 transitions. Word has length 12 [2020-10-16 12:09:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:41,310 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1184 transitions. [2020-10-16 12:09:41,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1184 transitions. [2020-10-16 12:09:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:09:41,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:41,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:41,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:09:41,312 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash 882578508, now seen corresponding path program 2 times [2020-10-16 12:09:41,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:41,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495011543] [2020-10-16 12:09:41,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:41,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495011543] [2020-10-16 12:09:41,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:41,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:41,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689009144] [2020-10-16 12:09:41,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:41,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:41,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:41,422 INFO L87 Difference]: Start difference. First operand 427 states and 1184 transitions. Second operand 5 states. [2020-10-16 12:09:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:41,528 INFO L93 Difference]: Finished difference Result 436 states and 1204 transitions. [2020-10-16 12:09:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:09:41,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:09:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:41,533 INFO L225 Difference]: With dead ends: 436 [2020-10-16 12:09:41,534 INFO L226 Difference]: Without dead ends: 436 [2020-10-16 12:09:41,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2020-10-16 12:09:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2020-10-16 12:09:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-10-16 12:09:41,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1193 transitions. [2020-10-16 12:09:41,551 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1193 transitions. Word has length 12 [2020-10-16 12:09:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:41,552 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1193 transitions. [2020-10-16 12:09:41,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1193 transitions. [2020-10-16 12:09:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:09:41,553 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:41,553 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:41,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:09:41,554 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 939905806, now seen corresponding path program 1 times [2020-10-16 12:09:41,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:41,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170493358] [2020-10-16 12:09:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:41,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170493358] [2020-10-16 12:09:41,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:41,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:41,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222011281] [2020-10-16 12:09:41,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:41,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:41,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:41,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:41,717 INFO L87 Difference]: Start difference. First operand 432 states and 1193 transitions. Second operand 5 states. [2020-10-16 12:09:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:41,824 INFO L93 Difference]: Finished difference Result 428 states and 1179 transitions. [2020-10-16 12:09:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:09:41,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:09:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:41,828 INFO L225 Difference]: With dead ends: 428 [2020-10-16 12:09:41,828 INFO L226 Difference]: Without dead ends: 428 [2020-10-16 12:09:41,829 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-10-16 12:09:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 412. [2020-10-16 12:09:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-10-16 12:09:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1147 transitions. [2020-10-16 12:09:41,843 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1147 transitions. Word has length 13 [2020-10-16 12:09:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:41,843 INFO L481 AbstractCegarLoop]: Abstraction has 412 states and 1147 transitions. [2020-10-16 12:09:41,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1147 transitions. [2020-10-16 12:09:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:09:41,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:41,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:41,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:09:41,845 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1629567973, now seen corresponding path program 1 times [2020-10-16 12:09:41,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:41,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036988775] [2020-10-16 12:09:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:42,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036988775] [2020-10-16 12:09:42,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:42,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:42,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961614266] [2020-10-16 12:09:42,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:42,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:42,027 INFO L87 Difference]: Start difference. First operand 412 states and 1147 transitions. Second operand 5 states. [2020-10-16 12:09:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:42,138 INFO L93 Difference]: Finished difference Result 466 states and 1267 transitions. [2020-10-16 12:09:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:09:42,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 12:09:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:42,143 INFO L225 Difference]: With dead ends: 466 [2020-10-16 12:09:42,143 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 12:09:42,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 12:09:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 426. [2020-10-16 12:09:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 12:09:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1160 transitions. [2020-10-16 12:09:42,159 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1160 transitions. Word has length 13 [2020-10-16 12:09:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:42,160 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1160 transitions. [2020-10-16 12:09:42,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1160 transitions. [2020-10-16 12:09:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:09:42,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:42,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:42,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:09:42,164 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:42,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1393638489, now seen corresponding path program 1 times [2020-10-16 12:09:42,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:42,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477755357] [2020-10-16 12:09:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:42,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477755357] [2020-10-16 12:09:42,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:42,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:09:42,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198675966] [2020-10-16 12:09:42,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:09:42,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:42,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:09:42,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:09:42,259 INFO L87 Difference]: Start difference. First operand 426 states and 1160 transitions. Second operand 4 states. [2020-10-16 12:09:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:42,303 INFO L93 Difference]: Finished difference Result 416 states and 998 transitions. [2020-10-16 12:09:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:09:42,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-16 12:09:42,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:42,306 INFO L225 Difference]: With dead ends: 416 [2020-10-16 12:09:42,306 INFO L226 Difference]: Without dead ends: 306 [2020-10-16 12:09:42,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:42,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-16 12:09:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-10-16 12:09:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-10-16 12:09:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 712 transitions. [2020-10-16 12:09:42,319 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 712 transitions. Word has length 14 [2020-10-16 12:09:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:42,320 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 712 transitions. [2020-10-16 12:09:42,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:09:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 712 transitions. [2020-10-16 12:09:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:09:42,321 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:42,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:42,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:09:42,321 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash 211902524, now seen corresponding path program 1 times [2020-10-16 12:09:42,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:42,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315112717] [2020-10-16 12:09:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:42,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315112717] [2020-10-16 12:09:42,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:42,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:09:42,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734947278] [2020-10-16 12:09:42,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:09:42,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:09:42,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:09:42,420 INFO L87 Difference]: Start difference. First operand 306 states and 712 transitions. Second operand 5 states. [2020-10-16 12:09:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:42,501 INFO L93 Difference]: Finished difference Result 253 states and 542 transitions. [2020-10-16 12:09:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:09:42,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 12:09:42,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:42,504 INFO L225 Difference]: With dead ends: 253 [2020-10-16 12:09:42,504 INFO L226 Difference]: Without dead ends: 197 [2020-10-16 12:09:42,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-16 12:09:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2020-10-16 12:09:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-16 12:09:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 378 transitions. [2020-10-16 12:09:42,510 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 378 transitions. Word has length 15 [2020-10-16 12:09:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:42,512 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 378 transitions. [2020-10-16 12:09:42,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:09:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 378 transitions. [2020-10-16 12:09:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:09:42,513 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:42,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:42,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:09:42,513 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1129550295, now seen corresponding path program 1 times [2020-10-16 12:09:42,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:42,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875051692] [2020-10-16 12:09:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:42,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875051692] [2020-10-16 12:09:42,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:42,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:09:42,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235585958] [2020-10-16 12:09:42,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:09:42,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:09:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:09:42,611 INFO L87 Difference]: Start difference. First operand 179 states and 378 transitions. Second operand 6 states. [2020-10-16 12:09:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:42,671 INFO L93 Difference]: Finished difference Result 162 states and 343 transitions. [2020-10-16 12:09:42,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:09:42,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:09:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:42,674 INFO L225 Difference]: With dead ends: 162 [2020-10-16 12:09:42,674 INFO L226 Difference]: Without dead ends: 113 [2020-10-16 12:09:42,676 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:09:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-16 12:09:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-16 12:09:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-16 12:09:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 237 transitions. [2020-10-16 12:09:42,681 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 237 transitions. Word has length 17 [2020-10-16 12:09:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:42,681 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 237 transitions. [2020-10-16 12:09:42,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:09:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 237 transitions. [2020-10-16 12:09:42,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:42,682 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:42,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:42,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:09:42,683 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:42,683 INFO L82 PathProgramCache]: Analyzing trace with hash 444947368, now seen corresponding path program 1 times [2020-10-16 12:09:42,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:42,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463485682] [2020-10-16 12:09:42,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:42,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463485682] [2020-10-16 12:09:42,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:42,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:09:42,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231293906] [2020-10-16 12:09:42,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:09:42,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:09:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:09:42,984 INFO L87 Difference]: Start difference. First operand 113 states and 237 transitions. Second operand 7 states. [2020-10-16 12:09:43,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:43,172 INFO L93 Difference]: Finished difference Result 145 states and 298 transitions. [2020-10-16 12:09:43,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:09:43,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-16 12:09:43,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:43,174 INFO L225 Difference]: With dead ends: 145 [2020-10-16 12:09:43,175 INFO L226 Difference]: Without dead ends: 115 [2020-10-16 12:09:43,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:09:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-16 12:09:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2020-10-16 12:09:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-16 12:09:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 189 transitions. [2020-10-16 12:09:43,180 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 189 transitions. Word has length 20 [2020-10-16 12:09:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:43,180 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 189 transitions. [2020-10-16 12:09:43,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:09:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 189 transitions. [2020-10-16 12:09:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:43,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:43,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:43,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:09:43,181 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1757585640, now seen corresponding path program 2 times [2020-10-16 12:09:43,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:43,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194613618] [2020-10-16 12:09:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:09:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:09:43,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194613618] [2020-10-16 12:09:43,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:09:43,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:09:43,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297093075] [2020-10-16 12:09:43,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:09:43,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:09:43,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:09:43,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:09:43,486 INFO L87 Difference]: Start difference. First operand 97 states and 189 transitions. Second operand 9 states. [2020-10-16 12:09:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:09:43,751 INFO L93 Difference]: Finished difference Result 152 states and 289 transitions. [2020-10-16 12:09:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:09:43,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-16 12:09:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:09:43,752 INFO L225 Difference]: With dead ends: 152 [2020-10-16 12:09:43,752 INFO L226 Difference]: Without dead ends: 106 [2020-10-16 12:09:43,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:09:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-16 12:09:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2020-10-16 12:09:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-16 12:09:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 143 transitions. [2020-10-16 12:09:43,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 143 transitions. Word has length 20 [2020-10-16 12:09:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:09:43,756 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 143 transitions. [2020-10-16 12:09:43,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:09:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 143 transitions. [2020-10-16 12:09:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:09:43,757 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:09:43,757 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:09:43,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:09:43,758 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:09:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:09:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1467741448, now seen corresponding path program 3 times [2020-10-16 12:09:43,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:09:43,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643072979] [2020-10-16 12:09:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:09:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:09:43,797 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:09:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:09:43,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:09:43,876 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:09:43,876 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:09:43,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:09:43,878 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:09:43,894 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L2-->L818: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In443617531 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In443617531 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In443617531 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In443617531 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out443617531 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out443617531 ~y$w_buff1_used~0_In443617531))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out443617531 0)) (= ~y$r_buff1_thd0~0_In443617531 ~y$r_buff1_thd0~0_Out443617531) (= ~y$r_buff0_thd0~0_In443617531 ~y$r_buff0_thd0~0_Out443617531) (or (and (= ~y$w_buff0_used~0_Out443617531 ~y$w_buff0_used~0_In443617531) .cse3) (and (= ~y$w_buff0_used~0_Out443617531 0) .cse4 .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out443617531 |ULTIMATE.start_assume_abort_if_not_#in~cond_In443617531|) (or (and (or (and .cse2 (= ~y~0_Out443617531 ~y~0_In443617531)) (and (= ~y~0_Out443617531 ~y$w_buff1~0_In443617531) .cse0 .cse1)) .cse3) (and (= ~y$w_buff0~0_In443617531 ~y~0_Out443617531) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In443617531|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443617531, ~y$w_buff1~0=~y$w_buff1~0_In443617531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In443617531, ~y$w_buff0~0=~y$w_buff0~0_In443617531, ~y~0=~y~0_In443617531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In443617531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443617531} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out443617531|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out443617531, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out443617531|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out443617531|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out443617531|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out443617531|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out443617531|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In443617531|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out443617531, ~y$w_buff1~0=~y$w_buff1~0_In443617531, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out443617531, ~y$w_buff0~0=~y$w_buff0~0_In443617531, ~y~0=~y~0_Out443617531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out443617531, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out443617531} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:09:43,899 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,899 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,900 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,900 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,901 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,901 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,902 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,903 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,903 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,904 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,904 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,904 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,911 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,912 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:43,913 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:09:43,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:09:44,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:09:44 BasicIcfg [2020-10-16 12:09:44,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:09:44,004 INFO L168 Benchmark]: Toolchain (without parser) took 16035.80 ms. Allocated memory was 141.0 MB in the beginning and 350.7 MB in the end (delta: 209.7 MB). Free memory was 102.2 MB in the beginning and 117.3 MB in the end (delta: -15.1 MB). Peak memory consumption was 194.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,009 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.70 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 101.8 MB in the beginning and 158.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.97 ms. Allocated memory is still 203.9 MB. Free memory was 158.7 MB in the beginning and 155.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,014 INFO L168 Benchmark]: Boogie Preprocessor took 42.29 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,014 INFO L168 Benchmark]: RCFGBuilder took 2138.70 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 153.9 MB in the beginning and 168.5 MB in the end (delta: -14.6 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,015 INFO L168 Benchmark]: TraceAbstraction took 12958.01 ms. Allocated memory was 246.4 MB in the beginning and 350.7 MB in the end (delta: 104.3 MB). Free memory was 166.6 MB in the beginning and 117.3 MB in the end (delta: 49.3 MB). Peak memory consumption was 153.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:09:44,021 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.70 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 101.8 MB in the beginning and 158.7 MB in the end (delta: -56.9 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.97 ms. Allocated memory is still 203.9 MB. Free memory was 158.7 MB in the beginning and 155.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.29 ms. Allocated memory is still 203.9 MB. Free memory was 155.7 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2138.70 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 153.9 MB in the beginning and 168.5 MB in the end (delta: -14.6 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12958.01 ms. Allocated memory was 246.4 MB in the beginning and 350.7 MB in the end (delta: 104.3 MB). Free memory was 166.6 MB in the beginning and 117.3 MB in the end (delta: 49.3 MB). Peak memory consumption was 153.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 803 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 41 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 98 PlacesBefore, 35 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1560 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 4070 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L802] 0 pthread_t t2180; [L803] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2181; [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L806] 0 pthread_t t2182; [L807] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 312 SDtfs, 367 SDslu, 574 SDs, 0 SdLazy, 364 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=662occurred 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.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 141 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 26036 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...