/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/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:27:37,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:27:37,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:27:37,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:27:37,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:27:37,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:27:37,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:27:37,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:27:37,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:27:37,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:27:37,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:27:37,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:27:37,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:27:37,787 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:27:37,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:27:37,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:27:37,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:27:37,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:27:37,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:27:37,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:27:37,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:27:37,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:27:37,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:27:37,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:27:37,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:27:37,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:27:37,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:27:37,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:27:37,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:27:37,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:27:37,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:27:37,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:27:37,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:27:37,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:27:37,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:27:37,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:27:37,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:27:37,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:27:37,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:27:37,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:27:37,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:27:37,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:27:37,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:27:37,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:27:37,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:27:37,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:27:37,866 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:27:37,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:27:37,866 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:27:37,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:27:37,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:27:37,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:27:37,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:27:37,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:27:37,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:27:37,868 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:27:37,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:27:37,869 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:27:37,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:27:37,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:27:37,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:27:37,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:27:37,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:27:37,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:27:37,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:27:37,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:27:38,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:27:38,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:27:38,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:27:38,149 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:27:38,151 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:27:38,152 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-05 23:27:38,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad7d5b52/35f459f5227a4fa6893a4def53bf5cc6/FLAG2af2ba6f4 [2020-10-05 23:27:38,750 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:27:38,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-05 23:27:38,767 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad7d5b52/35f459f5227a4fa6893a4def53bf5cc6/FLAG2af2ba6f4 [2020-10-05 23:27:39,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad7d5b52/35f459f5227a4fa6893a4def53bf5cc6 [2020-10-05 23:27:39,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:27:39,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:27:39,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:27:39,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:27:39,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:27:39,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15101969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39, skipping insertion in model container [2020-10-05 23:27:39,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:27:39,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:27:39,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:27:39,643 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:27:39,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:27:39,800 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:27:39,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39 WrapperNode [2020-10-05 23:27:39,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:27:39,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:27:39,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:27:39,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:27:39,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:27:39,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:27:39,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:27:39,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:27:39,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... [2020-10-05 23:27:39,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:27:39,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:27:39,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:27:39,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:27:39,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:27:39,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:27:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:27:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:27:39,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:27:39,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:27:39,986 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:27:39,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:27:39,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:27:39,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:27:39,989 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:27:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:27:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:27:39,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:27:39,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:27:39,992 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:27:42,204 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:27:42,204 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:27:42,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:27:42 BoogieIcfgContainer [2020-10-05 23:27:42,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:27:42,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:27:42,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:27:42,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:27:42,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:27:39" (1/3) ... [2020-10-05 23:27:42,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b42ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:27:42, skipping insertion in model container [2020-10-05 23:27:42,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:27:39" (2/3) ... [2020-10-05 23:27:42,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b42ce04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:27:42, skipping insertion in model container [2020-10-05 23:27:42,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:27:42" (3/3) ... [2020-10-05 23:27:42,214 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-05 23:27:42,224 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:27:42,225 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:27:42,233 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:27:42,234 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:27:42,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,265 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,265 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,266 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,270 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,273 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,273 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,276 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,276 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,282 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,283 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,283 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,284 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,284 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,288 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:27:42,311 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:27:42,331 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:27:42,332 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:27:42,332 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:27:42,332 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:27:42,332 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:27:42,332 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:27:42,333 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:27:42,333 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:27:42,348 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-05 23:27:42,350 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-05 23:27:42,401 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-05 23:27:42,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:27:42,406 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-05 23:27:42,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-05 23:27:42,463 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-05 23:27:42,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:27:42,465 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-05 23:27:42,467 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2816 [2020-10-05 23:27:42,469 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:27:43,792 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-05 23:27:45,480 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-05 23:27:45,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 1] term [2020-10-05 23:27:45,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:27:45,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-05 23:27:45,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:27:46,568 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 156 DAG size of output: 127 [2020-10-05 23:27:47,562 WARN L193 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 194 [2020-10-05 23:27:47,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 1] term [2020-10-05 23:27:47,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:27:47,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-05 23:27:47,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:27:48,305 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 113 [2020-10-05 23:27:48,910 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-05 23:27:49,324 WARN L193 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-05 23:27:50,004 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2020-10-05 23:27:50,517 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-10-05 23:27:50,787 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-05 23:27:50,919 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-05 23:27:50,929 INFO L206 etLargeBlockEncoding]: Checked pairs total: 8816 [2020-10-05 23:27:50,929 INFO L214 etLargeBlockEncoding]: Total number of compositions: 91 [2020-10-05 23:27:50,933 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 35 transitions, 90 flow [2020-10-05 23:27:51,352 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5832 states. [2020-10-05 23:27:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 5832 states. [2020-10-05 23:27:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:27:51,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:51,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:27:51,363 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:51,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1158467632, now seen corresponding path program 1 times [2020-10-05 23:27:51,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:51,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141529729] [2020-10-05 23:27:51,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:51,621 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-05 23:27:51,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141529729] [2020-10-05 23:27:51,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:51,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:27:51,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473700644] [2020-10-05 23:27:51,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:27:51,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:27:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:27:51,645 INFO L87 Difference]: Start difference. First operand 5832 states. Second operand 3 states. [2020-10-05 23:27:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:51,862 INFO L93 Difference]: Finished difference Result 4862 states and 19480 transitions. [2020-10-05 23:27:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:27:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:27:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:51,920 INFO L225 Difference]: With dead ends: 4862 [2020-10-05 23:27:51,921 INFO L226 Difference]: Without dead ends: 3962 [2020-10-05 23:27:51,922 INFO L675 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-05 23:27:51,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-10-05 23:27:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-10-05 23:27:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-10-05 23:27:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15640 transitions. [2020-10-05 23:27:52,161 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15640 transitions. Word has length 5 [2020-10-05 23:27:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:52,161 INFO L479 AbstractCegarLoop]: Abstraction has 3962 states and 15640 transitions. [2020-10-05 23:27:52,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:27:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15640 transitions. [2020-10-05 23:27:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:27:52,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:52,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:52,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:27:52,165 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash -168156543, now seen corresponding path program 1 times [2020-10-05 23:27:52,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:52,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744675082] [2020-10-05 23:27:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:52,284 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-05 23:27:52,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744675082] [2020-10-05 23:27:52,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:52,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:27:52,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488924567] [2020-10-05 23:27:52,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:27:52,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:27:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:27:52,289 INFO L87 Difference]: Start difference. First operand 3962 states and 15640 transitions. Second operand 3 states. [2020-10-05 23:27:52,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:52,333 INFO L93 Difference]: Finished difference Result 3662 states and 14310 transitions. [2020-10-05 23:27:52,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:27:52,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:27:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:52,368 INFO L225 Difference]: With dead ends: 3662 [2020-10-05 23:27:52,369 INFO L226 Difference]: Without dead ends: 3662 [2020-10-05 23:27:52,369 INFO L675 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-05 23:27:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2020-10-05 23:27:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2020-10-05 23:27:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-10-05 23:27:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14310 transitions. [2020-10-05 23:27:52,527 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14310 transitions. Word has length 11 [2020-10-05 23:27:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:52,528 INFO L479 AbstractCegarLoop]: Abstraction has 3662 states and 14310 transitions. [2020-10-05 23:27:52,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:27:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14310 transitions. [2020-10-05 23:27:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:27:52,533 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:52,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:52,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:27:52,534 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1622091736, now seen corresponding path program 1 times [2020-10-05 23:27:52,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:52,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111005391] [2020-10-05 23:27:52,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:52,614 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-05 23:27:52,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111005391] [2020-10-05 23:27:52,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:52,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:27:52,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323118927] [2020-10-05 23:27:52,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:27:52,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:52,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:27:52,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:27:52,620 INFO L87 Difference]: Start difference. First operand 3662 states and 14310 transitions. Second operand 3 states. [2020-10-05 23:27:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:52,696 INFO L93 Difference]: Finished difference Result 3622 states and 14128 transitions. [2020-10-05 23:27:52,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:27:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-05 23:27:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:52,733 INFO L225 Difference]: With dead ends: 3622 [2020-10-05 23:27:52,734 INFO L226 Difference]: Without dead ends: 3622 [2020-10-05 23:27:52,734 INFO L675 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-05 23:27:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2020-10-05 23:27:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2020-10-05 23:27:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2020-10-05 23:27:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 14128 transitions. [2020-10-05 23:27:52,933 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 14128 transitions. Word has length 13 [2020-10-05 23:27:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:52,934 INFO L479 AbstractCegarLoop]: Abstraction has 3622 states and 14128 transitions. [2020-10-05 23:27:52,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:27:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 14128 transitions. [2020-10-05 23:27:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:27:52,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:52,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:52,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:27:52,937 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1254763892, now seen corresponding path program 1 times [2020-10-05 23:27:52,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:52,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137520863] [2020-10-05 23:27:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:52,997 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-05 23:27:52,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137520863] [2020-10-05 23:27:52,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:27:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103219905] [2020-10-05 23:27:52,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:27:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:27:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:27:53,000 INFO L87 Difference]: Start difference. First operand 3622 states and 14128 transitions. Second operand 3 states. [2020-10-05 23:27:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:53,037 INFO L93 Difference]: Finished difference Result 3462 states and 13440 transitions. [2020-10-05 23:27:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:27:53,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-05 23:27:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:53,079 INFO L225 Difference]: With dead ends: 3462 [2020-10-05 23:27:53,080 INFO L226 Difference]: Without dead ends: 3462 [2020-10-05 23:27:53,080 INFO L675 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-05 23:27:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2020-10-05 23:27:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2020-10-05 23:27:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-10-05 23:27:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13440 transitions. [2020-10-05 23:27:53,192 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13440 transitions. Word has length 14 [2020-10-05 23:27:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:53,192 INFO L479 AbstractCegarLoop]: Abstraction has 3462 states and 13440 transitions. [2020-10-05 23:27:53,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:27:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13440 transitions. [2020-10-05 23:27:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:27:53,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:53,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:53,196 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:27:53,196 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -242993124, now seen corresponding path program 1 times [2020-10-05 23:27:53,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:53,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391332586] [2020-10-05 23:27:53,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:53,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-05 23:27:53,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391332586] [2020-10-05 23:27:53,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:53,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:27:53,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679287020] [2020-10-05 23:27:53,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:27:53,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:27:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:27:53,356 INFO L87 Difference]: Start difference. First operand 3462 states and 13440 transitions. Second operand 4 states. [2020-10-05 23:27:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:53,440 INFO L93 Difference]: Finished difference Result 3430 states and 13296 transitions. [2020-10-05 23:27:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:27:53,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:27:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:53,462 INFO L225 Difference]: With dead ends: 3430 [2020-10-05 23:27:53,462 INFO L226 Difference]: Without dead ends: 3430 [2020-10-05 23:27:53,463 INFO L675 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-05 23:27:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2020-10-05 23:27:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3430. [2020-10-05 23:27:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2020-10-05 23:27:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 13296 transitions. [2020-10-05 23:27:53,590 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 13296 transitions. Word has length 15 [2020-10-05 23:27:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:53,590 INFO L479 AbstractCegarLoop]: Abstraction has 3430 states and 13296 transitions. [2020-10-05 23:27:53,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:27:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 13296 transitions. [2020-10-05 23:27:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:27:53,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:53,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:53,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:27:53,595 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1057147592, now seen corresponding path program 1 times [2020-10-05 23:27:53,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:53,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817752108] [2020-10-05 23:27:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:53,772 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-05 23:27:53,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817752108] [2020-10-05 23:27:53,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:53,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:27:53,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979551016] [2020-10-05 23:27:53,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:27:53,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:53,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:27:53,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:53,776 INFO L87 Difference]: Start difference. First operand 3430 states and 13296 transitions. Second operand 5 states. [2020-10-05 23:27:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:53,894 INFO L93 Difference]: Finished difference Result 3670 states and 14248 transitions. [2020-10-05 23:27:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:53,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:27:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:53,912 INFO L225 Difference]: With dead ends: 3670 [2020-10-05 23:27:53,913 INFO L226 Difference]: Without dead ends: 3670 [2020-10-05 23:27:53,913 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2020-10-05 23:27:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3670. [2020-10-05 23:27:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3670 states. [2020-10-05 23:27:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 14248 transitions. [2020-10-05 23:27:54,145 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 14248 transitions. Word has length 16 [2020-10-05 23:27:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:54,146 INFO L479 AbstractCegarLoop]: Abstraction has 3670 states and 14248 transitions. [2020-10-05 23:27:54,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:27:54,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 14248 transitions. [2020-10-05 23:27:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:27:54,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:54,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:54,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:27:54,152 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:54,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:54,153 INFO L82 PathProgramCache]: Analyzing trace with hash 617081770, now seen corresponding path program 1 times [2020-10-05 23:27:54,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:54,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999997654] [2020-10-05 23:27:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:54,225 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-05 23:27:54,226 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999997654] [2020-10-05 23:27:54,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:54,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:27:54,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821162219] [2020-10-05 23:27:54,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:27:54,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:54,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:27:54,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:54,228 INFO L87 Difference]: Start difference. First operand 3670 states and 14248 transitions. Second operand 5 states. [2020-10-05 23:27:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:54,331 INFO L93 Difference]: Finished difference Result 3622 states and 14048 transitions. [2020-10-05 23:27:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:54,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:27:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:54,348 INFO L225 Difference]: With dead ends: 3622 [2020-10-05 23:27:54,349 INFO L226 Difference]: Without dead ends: 3622 [2020-10-05 23:27:54,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3622 states. [2020-10-05 23:27:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3622 to 3622. [2020-10-05 23:27:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3622 states. [2020-10-05 23:27:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 14048 transitions. [2020-10-05 23:27:54,466 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 14048 transitions. Word has length 17 [2020-10-05 23:27:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:54,466 INFO L479 AbstractCegarLoop]: Abstraction has 3622 states and 14048 transitions. [2020-10-05 23:27:54,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:27:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 14048 transitions. [2020-10-05 23:27:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:54,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:54,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:54,474 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:27:54,474 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1949665530, now seen corresponding path program 1 times [2020-10-05 23:27:54,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:54,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728487278] [2020-10-05 23:27:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:54,623 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-05 23:27:54,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728487278] [2020-10-05 23:27:54,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:54,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:27:54,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983450503] [2020-10-05 23:27:54,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:27:54,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:27:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:54,625 INFO L87 Difference]: Start difference. First operand 3622 states and 14048 transitions. Second operand 6 states. [2020-10-05 23:27:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:54,740 INFO L93 Difference]: Finished difference Result 4354 states and 16924 transitions. [2020-10-05 23:27:54,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:27:54,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:27:54,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:54,760 INFO L225 Difference]: With dead ends: 4354 [2020-10-05 23:27:54,760 INFO L226 Difference]: Without dead ends: 4354 [2020-10-05 23:27:54,761 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2020-10-05 23:27:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 4354. [2020-10-05 23:27:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4354 states. [2020-10-05 23:27:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4354 states to 4354 states and 16924 transitions. [2020-10-05 23:27:54,896 INFO L78 Accepts]: Start accepts. Automaton has 4354 states and 16924 transitions. Word has length 18 [2020-10-05 23:27:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:54,897 INFO L479 AbstractCegarLoop]: Abstraction has 4354 states and 16924 transitions. [2020-10-05 23:27:54,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:27:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4354 states and 16924 transitions. [2020-10-05 23:27:54,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:54,905 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:54,906 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:54,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:27:54,906 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash 313735544, now seen corresponding path program 2 times [2020-10-05 23:27:54,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:54,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848375501] [2020-10-05 23:27:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:54,992 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-05 23:27:54,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848375501] [2020-10-05 23:27:54,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:54,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:27:54,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335734982] [2020-10-05 23:27:54,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:27:54,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:27:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:54,996 INFO L87 Difference]: Start difference. First operand 4354 states and 16924 transitions. Second operand 5 states. [2020-10-05 23:27:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:55,087 INFO L93 Difference]: Finished difference Result 4966 states and 19268 transitions. [2020-10-05 23:27:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:55,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 23:27:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:55,108 INFO L225 Difference]: With dead ends: 4966 [2020-10-05 23:27:55,109 INFO L226 Difference]: Without dead ends: 4966 [2020-10-05 23:27:55,110 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2020-10-05 23:27:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4474. [2020-10-05 23:27:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2020-10-05 23:27:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 17278 transitions. [2020-10-05 23:27:55,757 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 17278 transitions. Word has length 18 [2020-10-05 23:27:55,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:55,757 INFO L479 AbstractCegarLoop]: Abstraction has 4474 states and 17278 transitions. [2020-10-05 23:27:55,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:27:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 17278 transitions. [2020-10-05 23:27:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:55,766 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:55,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:55,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:27:55,767 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -458952755, now seen corresponding path program 1 times [2020-10-05 23:27:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:55,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194725189] [2020-10-05 23:27:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:56,033 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-05 23:27:56,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194725189] [2020-10-05 23:27:56,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:56,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:27:56,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720122233] [2020-10-05 23:27:56,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:27:56,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:56,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:27:56,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:56,036 INFO L87 Difference]: Start difference. First operand 4474 states and 17278 transitions. Second operand 6 states. [2020-10-05 23:27:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:56,153 INFO L93 Difference]: Finished difference Result 4506 states and 17382 transitions. [2020-10-05 23:27:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:56,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:27:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:56,167 INFO L225 Difference]: With dead ends: 4506 [2020-10-05 23:27:56,167 INFO L226 Difference]: Without dead ends: 4506 [2020-10-05 23:27:56,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:27:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2020-10-05 23:27:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 4346. [2020-10-05 23:27:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2020-10-05 23:27:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 16750 transitions. [2020-10-05 23:27:56,295 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 16750 transitions. Word has length 18 [2020-10-05 23:27:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:56,296 INFO L479 AbstractCegarLoop]: Abstraction has 4346 states and 16750 transitions. [2020-10-05 23:27:56,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:27:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 16750 transitions. [2020-10-05 23:27:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:56,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:56,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:56,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:27:56,305 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:56,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1989968945, now seen corresponding path program 1 times [2020-10-05 23:27:56,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:56,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388497003] [2020-10-05 23:27:56,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:56,404 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-05 23:27:56,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388497003] [2020-10-05 23:27:56,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:56,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:27:56,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173957886] [2020-10-05 23:27:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:27:56,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:27:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:56,406 INFO L87 Difference]: Start difference. First operand 4346 states and 16750 transitions. Second operand 6 states. [2020-10-05 23:27:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:56,532 INFO L93 Difference]: Finished difference Result 4538 states and 17486 transitions. [2020-10-05 23:27:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:56,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:27:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:56,543 INFO L225 Difference]: With dead ends: 4538 [2020-10-05 23:27:56,543 INFO L226 Difference]: Without dead ends: 4538 [2020-10-05 23:27:56,543 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:27:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2020-10-05 23:27:56,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 4442. [2020-10-05 23:27:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4442 states. [2020-10-05 23:27:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 17134 transitions. [2020-10-05 23:27:56,663 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 17134 transitions. Word has length 18 [2020-10-05 23:27:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:56,663 INFO L479 AbstractCegarLoop]: Abstraction has 4442 states and 17134 transitions. [2020-10-05 23:27:56,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:27:56,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 17134 transitions. [2020-10-05 23:27:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:56,672 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:56,672 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:56,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:27:56,672 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1988485657, now seen corresponding path program 1 times [2020-10-05 23:27:56,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:56,673 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191647535] [2020-10-05 23:27:56,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:56,751 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-05 23:27:56,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191647535] [2020-10-05 23:27:56,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:56,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:27:56,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463356481] [2020-10-05 23:27:56,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:27:56,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:27:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:56,754 INFO L87 Difference]: Start difference. First operand 4442 states and 17134 transitions. Second operand 6 states. [2020-10-05 23:27:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:56,970 INFO L93 Difference]: Finished difference Result 7326 states and 28014 transitions. [2020-10-05 23:27:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:27:56,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:27:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:57,084 INFO L225 Difference]: With dead ends: 7326 [2020-10-05 23:27:57,084 INFO L226 Difference]: Without dead ends: 5204 [2020-10-05 23:27:57,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:27:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5204 states. [2020-10-05 23:27:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5204 to 4996. [2020-10-05 23:27:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4996 states. [2020-10-05 23:27:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4996 states to 4996 states and 18614 transitions. [2020-10-05 23:27:57,216 INFO L78 Accepts]: Start accepts. Automaton has 4996 states and 18614 transitions. Word has length 18 [2020-10-05 23:27:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:57,216 INFO L479 AbstractCegarLoop]: Abstraction has 4996 states and 18614 transitions. [2020-10-05 23:27:57,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:27:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4996 states and 18614 transitions. [2020-10-05 23:27:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:57,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:57,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:57,227 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:27:57,227 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:57,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1405351413, now seen corresponding path program 2 times [2020-10-05 23:27:57,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:57,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799420141] [2020-10-05 23:27:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:57,266 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-05 23:27:57,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799420141] [2020-10-05 23:27:57,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:57,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:27:57,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932583005] [2020-10-05 23:27:57,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:27:57,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:27:57,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:27:57,268 INFO L87 Difference]: Start difference. First operand 4996 states and 18614 transitions. Second operand 4 states. [2020-10-05 23:27:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:57,323 INFO L93 Difference]: Finished difference Result 7090 states and 26312 transitions. [2020-10-05 23:27:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:57,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-05 23:27:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:57,342 INFO L225 Difference]: With dead ends: 7090 [2020-10-05 23:27:57,342 INFO L226 Difference]: Without dead ends: 5152 [2020-10-05 23:27:57,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-05 23:27:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5152 states. [2020-10-05 23:27:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5152 to 4258. [2020-10-05 23:27:57,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2020-10-05 23:27:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 15592 transitions. [2020-10-05 23:27:57,475 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 15592 transitions. Word has length 18 [2020-10-05 23:27:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:57,475 INFO L479 AbstractCegarLoop]: Abstraction has 4258 states and 15592 transitions. [2020-10-05 23:27:57,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:27:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 15592 transitions. [2020-10-05 23:27:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:27:57,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:57,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:57,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:27:57,483 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1349738343, now seen corresponding path program 3 times [2020-10-05 23:27:57,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:57,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768794973] [2020-10-05 23:27:57,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:57,569 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-05 23:27:57,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768794973] [2020-10-05 23:27:57,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:57,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:27:57,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792265579] [2020-10-05 23:27:57,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:27:57,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:57,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:27:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:27:57,572 INFO L87 Difference]: Start difference. First operand 4258 states and 15592 transitions. Second operand 4 states. [2020-10-05 23:27:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:57,619 INFO L93 Difference]: Finished difference Result 4342 states and 14478 transitions. [2020-10-05 23:27:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:57,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-05 23:27:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:57,629 INFO L225 Difference]: With dead ends: 4342 [2020-10-05 23:27:57,630 INFO L226 Difference]: Without dead ends: 3162 [2020-10-05 23:27:57,630 INFO L675 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-05 23:27:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2020-10-05 23:27:57,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3162. [2020-10-05 23:27:57,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2020-10-05 23:27:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 10364 transitions. [2020-10-05 23:27:57,705 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 10364 transitions. Word has length 18 [2020-10-05 23:27:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:57,706 INFO L479 AbstractCegarLoop]: Abstraction has 3162 states and 10364 transitions. [2020-10-05 23:27:57,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:27:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 10364 transitions. [2020-10-05 23:27:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:27:57,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:57,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:57,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:27:57,712 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1773750894, now seen corresponding path program 1 times [2020-10-05 23:27:57,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:57,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991752354] [2020-10-05 23:27:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:57,764 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-05 23:27:57,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991752354] [2020-10-05 23:27:57,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:57,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:27:57,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415871401] [2020-10-05 23:27:57,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:27:57,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:27:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:27:57,766 INFO L87 Difference]: Start difference. First operand 3162 states and 10364 transitions. Second operand 5 states. [2020-10-05 23:27:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:57,819 INFO L93 Difference]: Finished difference Result 2709 states and 8288 transitions. [2020-10-05 23:27:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:27:57,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-05 23:27:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:57,826 INFO L225 Difference]: With dead ends: 2709 [2020-10-05 23:27:57,826 INFO L226 Difference]: Without dead ends: 2043 [2020-10-05 23:27:57,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:27:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2020-10-05 23:27:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1847. [2020-10-05 23:27:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2020-10-05 23:27:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 5498 transitions. [2020-10-05 23:27:57,865 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 5498 transitions. Word has length 19 [2020-10-05 23:27:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:57,866 INFO L479 AbstractCegarLoop]: Abstraction has 1847 states and 5498 transitions. [2020-10-05 23:27:57,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:27:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 5498 transitions. [2020-10-05 23:27:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:27:57,870 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:57,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:57,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:27:57,871 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash -642367673, now seen corresponding path program 1 times [2020-10-05 23:27:57,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:57,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359012829] [2020-10-05 23:27:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:58,125 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-05 23:27:58,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359012829] [2020-10-05 23:27:58,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:58,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:27:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732571987] [2020-10-05 23:27:58,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:27:58,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:27:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:27:58,127 INFO L87 Difference]: Start difference. First operand 1847 states and 5498 transitions. Second operand 7 states. [2020-10-05 23:27:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:58,297 INFO L93 Difference]: Finished difference Result 1843 states and 5486 transitions. [2020-10-05 23:27:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:27:58,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-05 23:27:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:58,302 INFO L225 Difference]: With dead ends: 1843 [2020-10-05 23:27:58,302 INFO L226 Difference]: Without dead ends: 1843 [2020-10-05 23:27:58,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:27:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2020-10-05 23:27:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1763. [2020-10-05 23:27:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2020-10-05 23:27:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 5266 transitions. [2020-10-05 23:27:58,340 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 5266 transitions. Word has length 22 [2020-10-05 23:27:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:58,341 INFO L479 AbstractCegarLoop]: Abstraction has 1763 states and 5266 transitions. [2020-10-05 23:27:58,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:27:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 5266 transitions. [2020-10-05 23:27:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-05 23:27:58,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:58,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:58,346 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:27:58,346 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash -291029716, now seen corresponding path program 1 times [2020-10-05 23:27:58,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:58,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101443484] [2020-10-05 23:27:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:58,432 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-05 23:27:58,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101443484] [2020-10-05 23:27:58,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:58,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:27:58,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319148348] [2020-10-05 23:27:58,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:27:58,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:27:58,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:27:58,435 INFO L87 Difference]: Start difference. First operand 1763 states and 5266 transitions. Second operand 6 states. [2020-10-05 23:27:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:58,503 INFO L93 Difference]: Finished difference Result 1580 states and 4701 transitions. [2020-10-05 23:27:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:27:58,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-05 23:27:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:58,508 INFO L225 Difference]: With dead ends: 1580 [2020-10-05 23:27:58,508 INFO L226 Difference]: Without dead ends: 1418 [2020-10-05 23:27:58,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:27:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-10-05 23:27:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1314. [2020-10-05 23:27:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2020-10-05 23:27:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 4007 transitions. [2020-10-05 23:27:58,536 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 4007 transitions. Word has length 22 [2020-10-05 23:27:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:58,536 INFO L479 AbstractCegarLoop]: Abstraction has 1314 states and 4007 transitions. [2020-10-05 23:27:58,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:27:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 4007 transitions. [2020-10-05 23:27:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:27:58,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:58,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:58,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:27:58,541 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2101077513, now seen corresponding path program 1 times [2020-10-05 23:27:58,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:58,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559784280] [2020-10-05 23:27:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:58,707 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-05 23:27:58,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559784280] [2020-10-05 23:27:58,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:58,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:27:58,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099813134] [2020-10-05 23:27:58,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:27:58,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:58,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:27:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:27:58,710 INFO L87 Difference]: Start difference. First operand 1314 states and 4007 transitions. Second operand 10 states. [2020-10-05 23:27:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:59,213 INFO L93 Difference]: Finished difference Result 1828 states and 5553 transitions. [2020-10-05 23:27:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:27:59,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-05 23:27:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:59,221 INFO L225 Difference]: With dead ends: 1828 [2020-10-05 23:27:59,221 INFO L226 Difference]: Without dead ends: 1490 [2020-10-05 23:27:59,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:27:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-10-05 23:27:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1458. [2020-10-05 23:27:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2020-10-05 23:27:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4503 transitions. [2020-10-05 23:27:59,265 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4503 transitions. Word has length 25 [2020-10-05 23:27:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:59,266 INFO L479 AbstractCegarLoop]: Abstraction has 1458 states and 4503 transitions. [2020-10-05 23:27:59,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:27:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4503 transitions. [2020-10-05 23:27:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:27:59,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:59,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:59,271 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:27:59,271 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash 781594771, now seen corresponding path program 2 times [2020-10-05 23:27:59,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:59,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566332306] [2020-10-05 23:27:59,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:27:59,446 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-05 23:27:59,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566332306] [2020-10-05 23:27:59,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:27:59,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:27:59,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988929466] [2020-10-05 23:27:59,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:27:59,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:27:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:27:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:27:59,448 INFO L87 Difference]: Start difference. First operand 1458 states and 4503 transitions. Second operand 10 states. [2020-10-05 23:27:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:27:59,848 INFO L93 Difference]: Finished difference Result 1834 states and 5426 transitions. [2020-10-05 23:27:59,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:27:59,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-05 23:27:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:27:59,855 INFO L225 Difference]: With dead ends: 1834 [2020-10-05 23:27:59,855 INFO L226 Difference]: Without dead ends: 1642 [2020-10-05 23:27:59,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:27:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-05 23:27:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1578. [2020-10-05 23:27:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-10-05 23:27:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 4807 transitions. [2020-10-05 23:27:59,887 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 4807 transitions. Word has length 25 [2020-10-05 23:27:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:27:59,887 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 4807 transitions. [2020-10-05 23:27:59,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:27:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 4807 transitions. [2020-10-05 23:27:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:27:59,891 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:27:59,891 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:27:59,892 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:27:59,892 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:27:59,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:27:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 294828615, now seen corresponding path program 3 times [2020-10-05 23:27:59,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:27:59,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406457978] [2020-10-05 23:27:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:27:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:00,026 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-05 23:28:00,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406457978] [2020-10-05 23:28:00,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:00,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 23:28:00,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484210041] [2020-10-05 23:28:00,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 23:28:00,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:00,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 23:28:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:28:00,028 INFO L87 Difference]: Start difference. First operand 1578 states and 4807 transitions. Second operand 10 states. [2020-10-05 23:28:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:00,328 INFO L93 Difference]: Finished difference Result 1753 states and 5154 transitions. [2020-10-05 23:28:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:28:00,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-05 23:28:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:00,332 INFO L225 Difference]: With dead ends: 1753 [2020-10-05 23:28:00,332 INFO L226 Difference]: Without dead ends: 1635 [2020-10-05 23:28:00,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:28:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2020-10-05 23:28:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1561. [2020-10-05 23:28:00,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-10-05 23:28:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4698 transitions. [2020-10-05 23:28:00,361 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 4698 transitions. Word has length 25 [2020-10-05 23:28:00,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:00,361 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 4698 transitions. [2020-10-05 23:28:00,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 23:28:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 4698 transitions. [2020-10-05 23:28:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:28:00,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:00,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:00,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:28:00,366 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:00,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1157969713, now seen corresponding path program 4 times [2020-10-05 23:28:00,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:00,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734935983] [2020-10-05 23:28:00,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:00,483 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-05 23:28:00,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734935983] [2020-10-05 23:28:00,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:00,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:28:00,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215897399] [2020-10-05 23:28:00,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:28:00,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:00,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:28:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:28:00,485 INFO L87 Difference]: Start difference. First operand 1561 states and 4698 transitions. Second operand 9 states. [2020-10-05 23:28:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:00,677 INFO L93 Difference]: Finished difference Result 2190 states and 6453 transitions. [2020-10-05 23:28:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:28:00,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:28:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:00,681 INFO L225 Difference]: With dead ends: 2190 [2020-10-05 23:28:00,682 INFO L226 Difference]: Without dead ends: 1785 [2020-10-05 23:28:00,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:28:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2020-10-05 23:28:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1657. [2020-10-05 23:28:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2020-10-05 23:28:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4866 transitions. [2020-10-05 23:28:00,718 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4866 transitions. Word has length 25 [2020-10-05 23:28:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:00,718 INFO L479 AbstractCegarLoop]: Abstraction has 1657 states and 4866 transitions. [2020-10-05 23:28:00,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:28:00,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4866 transitions. [2020-10-05 23:28:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:28:00,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:00,723 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:00,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:28:00,723 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash 696769813, now seen corresponding path program 5 times [2020-10-05 23:28:00,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:00,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049598839] [2020-10-05 23:28:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:00,874 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-05 23:28:00,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049598839] [2020-10-05 23:28:00,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:00,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:28:00,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103668183] [2020-10-05 23:28:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:28:00,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:28:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:28:00,876 INFO L87 Difference]: Start difference. First operand 1657 states and 4866 transitions. Second operand 9 states. [2020-10-05 23:28:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:00,991 INFO L93 Difference]: Finished difference Result 1962 states and 5537 transitions. [2020-10-05 23:28:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:28:00,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-05 23:28:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:00,996 INFO L225 Difference]: With dead ends: 1962 [2020-10-05 23:28:00,996 INFO L226 Difference]: Without dead ends: 1793 [2020-10-05 23:28:00,996 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:28:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2020-10-05 23:28:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1346. [2020-10-05 23:28:01,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-10-05 23:28:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 3907 transitions. [2020-10-05 23:28:01,020 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 3907 transitions. Word has length 25 [2020-10-05 23:28:01,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:01,021 INFO L479 AbstractCegarLoop]: Abstraction has 1346 states and 3907 transitions. [2020-10-05 23:28:01,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:28:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 3907 transitions. [2020-10-05 23:28:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:28:01,024 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:01,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:01,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:28:01,024 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1198172463, now seen corresponding path program 6 times [2020-10-05 23:28:01,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:01,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857596464] [2020-10-05 23:28:01,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:01,108 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-05 23:28:01,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857596464] [2020-10-05 23:28:01,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:01,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:28:01,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194552721] [2020-10-05 23:28:01,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:28:01,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:28:01,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:28:01,111 INFO L87 Difference]: Start difference. First operand 1346 states and 3907 transitions. Second operand 7 states. [2020-10-05 23:28:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:01,219 INFO L93 Difference]: Finished difference Result 1316 states and 3846 transitions. [2020-10-05 23:28:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:28:01,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-05 23:28:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:01,223 INFO L225 Difference]: With dead ends: 1316 [2020-10-05 23:28:01,223 INFO L226 Difference]: Without dead ends: 985 [2020-10-05 23:28:01,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:28:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2020-10-05 23:28:01,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 977. [2020-10-05 23:28:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-10-05 23:28:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2873 transitions. [2020-10-05 23:28:01,246 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2873 transitions. Word has length 25 [2020-10-05 23:28:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:01,247 INFO L479 AbstractCegarLoop]: Abstraction has 977 states and 2873 transitions. [2020-10-05 23:28:01,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:28:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2873 transitions. [2020-10-05 23:28:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-05 23:28:01,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:01,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:01,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:28:01,251 INFO L427 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:01,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1928233226, now seen corresponding path program 1 times [2020-10-05 23:28:01,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:01,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925165155] [2020-10-05 23:28:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:01,315 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-05 23:28:01,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925165155] [2020-10-05 23:28:01,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:01,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:28:01,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462401753] [2020-10-05 23:28:01,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:28:01,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:01,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:28:01,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:28:01,318 INFO L87 Difference]: Start difference. First operand 977 states and 2873 transitions. Second operand 4 states. [2020-10-05 23:28:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:01,344 INFO L93 Difference]: Finished difference Result 1252 states and 3612 transitions. [2020-10-05 23:28:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:28:01,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-05 23:28:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:01,347 INFO L225 Difference]: With dead ends: 1252 [2020-10-05 23:28:01,347 INFO L226 Difference]: Without dead ends: 465 [2020-10-05 23:28:01,347 INFO L675 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-05 23:28:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2020-10-05 23:28:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2020-10-05 23:28:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2020-10-05 23:28:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1215 transitions. [2020-10-05 23:28:01,359 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1215 transitions. Word has length 29 [2020-10-05 23:28:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:01,359 INFO L479 AbstractCegarLoop]: Abstraction has 465 states and 1215 transitions. [2020-10-05 23:28:01,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:28:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1215 transitions. [2020-10-05 23:28:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-05 23:28:01,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:01,362 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:01,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:28:01,362 INFO L427 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash -704196376, now seen corresponding path program 2 times [2020-10-05 23:28:01,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:01,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639811612] [2020-10-05 23:28:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:01,429 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-05 23:28:01,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639811612] [2020-10-05 23:28:01,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:01,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:28:01,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900900743] [2020-10-05 23:28:01,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:28:01,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:28:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:28:01,432 INFO L87 Difference]: Start difference. First operand 465 states and 1215 transitions. Second operand 4 states. [2020-10-05 23:28:01,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:01,457 INFO L93 Difference]: Finished difference Result 518 states and 1323 transitions. [2020-10-05 23:28:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:28:01,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-05 23:28:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:01,460 INFO L225 Difference]: With dead ends: 518 [2020-10-05 23:28:01,460 INFO L226 Difference]: Without dead ends: 230 [2020-10-05 23:28:01,460 INFO L675 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-05 23:28:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-05 23:28:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2020-10-05 23:28:01,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2020-10-05 23:28:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 581 transitions. [2020-10-05 23:28:01,467 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 581 transitions. Word has length 29 [2020-10-05 23:28:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:01,467 INFO L479 AbstractCegarLoop]: Abstraction has 230 states and 581 transitions. [2020-10-05 23:28:01,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:28:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 581 transitions. [2020-10-05 23:28:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-05 23:28:01,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:01,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:01,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 23:28:01,469 INFO L427 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:01,470 INFO L82 PathProgramCache]: Analyzing trace with hash -261830384, now seen corresponding path program 3 times [2020-10-05 23:28:01,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:01,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961482449] [2020-10-05 23:28:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:28:01,819 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-05 23:28:01,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961482449] [2020-10-05 23:28:01,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:28:01,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:28:01,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399924119] [2020-10-05 23:28:01,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:28:01,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:28:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:28:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:28:01,821 INFO L87 Difference]: Start difference. First operand 230 states and 581 transitions. Second operand 9 states. [2020-10-05 23:28:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:28:02,102 INFO L93 Difference]: Finished difference Result 365 states and 913 transitions. [2020-10-05 23:28:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:28:02,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-10-05 23:28:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:28:02,103 INFO L225 Difference]: With dead ends: 365 [2020-10-05 23:28:02,103 INFO L226 Difference]: Without dead ends: 205 [2020-10-05 23:28:02,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:28:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-10-05 23:28:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 166. [2020-10-05 23:28:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-10-05 23:28:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 401 transitions. [2020-10-05 23:28:02,107 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 401 transitions. Word has length 29 [2020-10-05 23:28:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:28:02,108 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 401 transitions. [2020-10-05 23:28:02,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:28:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 401 transitions. [2020-10-05 23:28:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-05 23:28:02,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:28:02,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:28:02,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 23:28:02,109 INFO L427 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:28:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:28:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 431410192, now seen corresponding path program 4 times [2020-10-05 23:28:02,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:28:02,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206176793] [2020-10-05 23:28:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:28:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:28:02,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:28:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:28:02,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:28:02,276 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:28:02,276 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:28:02,277 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-05 23:28:02,278 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:28:02,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1173] [1173] L857-->L865: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In-1841877876 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-1841877876 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-1841877876 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-1841877876 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (= ~x$r_buff0_thd0~0_Out-1841877876 ~x$r_buff0_thd0~0_In-1841877876) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1841877876| (mod ~main$tmp_guard0~0_In-1841877876 256)) (or (and .cse0 (or (and (= ~x~0_Out-1841877876 ~x$w_buff1~0_In-1841877876) .cse1 .cse2) (and (= ~x~0_In-1841877876 ~x~0_Out-1841877876) .cse3))) (and .cse4 .cse5 (= ~x$w_buff0~0_In-1841877876 ~x~0_Out-1841877876))) (or (and (= ~x$w_buff1_used~0_Out-1841877876 ~x$w_buff1_used~0_In-1841877876) .cse3) (and (= ~x$w_buff1_used~0_Out-1841877876 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1841877876 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1841877876| ULTIMATE.start_assume_abort_if_not_~cond_Out-1841877876) (= ~x$r_buff1_thd0~0_In-1841877876 ~x$r_buff1_thd0~0_Out-1841877876) (or (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-1841877876 0)) (and .cse0 (= ~x$w_buff0_used~0_In-1841877876 ~x$w_buff0_used~0_Out-1841877876)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1841877876, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1841877876, ~x$w_buff1~0=~x$w_buff1~0_In-1841877876, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1841877876, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1841877876, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1841877876, ~x~0=~x~0_In-1841877876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841877876} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1841877876, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1841877876, ~x$w_buff1~0=~x$w_buff1~0_In-1841877876, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1841877876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1841877876, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-1841877876, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1841877876, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1841877876|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1841877876|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1841877876|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1841877876, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1841877876|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-1841877876|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1841877876|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1841877876, ~x~0=~x~0_Out-1841877876} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-05 23:28:02,312 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-05 23:28:02,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,314 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-05 23:28:02,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,314 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-05 23:28:02,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,314 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-05 23:28:02,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,315 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-05 23:28:02,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,315 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-05 23:28:02,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,318 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-05 23:28:02,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,318 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-05 23:28:02,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,318 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-05 23:28:02,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,319 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-05 23:28:02,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,319 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-05 23:28:02,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,320 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-05 23:28:02,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,320 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-05 23:28:02,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,321 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-05 23:28:02,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,321 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-05 23:28:02,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,321 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-05 23:28:02,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,322 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-05 23:28:02,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,322 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-05 23:28:02,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,322 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-05 23:28:02,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,327 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-05 23:28:02,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,327 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-05 23:28:02,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,327 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-05 23:28:02,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,328 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-05 23:28:02,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,329 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-05 23:28:02,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,329 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-05 23:28:02,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,329 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-05 23:28:02,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,330 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-05 23:28:02,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,330 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-05 23:28:02,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,330 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-05 23:28:02,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,330 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-05 23:28:02,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,331 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-05 23:28:02,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,331 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-05 23:28:02,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,331 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-05 23:28:02,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,332 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-05 23:28:02,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,332 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-05 23:28:02,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:28:02,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:28:02 BasicIcfg [2020-10-05 23:28:02,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:28:02,439 INFO L168 Benchmark]: Toolchain (without parser) took 23387.84 ms. Allocated memory was 141.6 MB in the beginning and 659.6 MB in the end (delta: 518.0 MB). Free memory was 102.9 MB in the beginning and 284.9 MB in the end (delta: -182.0 MB). Peak memory consumption was 336.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,440 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.00 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 154.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,446 INFO L168 Benchmark]: Boogie Preprocessor took 42.35 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,447 INFO L168 Benchmark]: RCFGBuilder took 2299.67 ms. Allocated memory was 205.5 MB in the beginning and 245.9 MB in the end (delta: 40.4 MB). Free memory was 151.7 MB in the beginning and 129.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,447 INFO L168 Benchmark]: TraceAbstraction took 20229.28 ms. Allocated memory was 245.9 MB in the beginning and 659.6 MB in the end (delta: 413.7 MB). Free memory was 127.5 MB in the beginning and 284.9 MB in the end (delta: -157.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:28:02,455 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.37 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.00 ms. Allocated memory was 141.6 MB in the beginning and 205.5 MB in the end (delta: 64.0 MB). Free memory was 102.7 MB in the beginning and 157.5 MB in the end (delta: -54.8 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.01 ms. Allocated memory is still 205.5 MB. Free memory was 157.5 MB in the beginning and 154.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.35 ms. Allocated memory is still 205.5 MB. Free memory was 154.3 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2299.67 ms. Allocated memory was 205.5 MB in the beginning and 245.9 MB in the end (delta: 40.4 MB). Free memory was 151.7 MB in the beginning and 129.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 95.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20229.28 ms. Allocated memory was 245.9 MB in the beginning and 659.6 MB in the end (delta: 413.7 MB). Free memory was 127.5 MB in the beginning and 284.9 MB in the end (delta: -157.3 MB). Peak memory consumption was 256.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 126 ProgramPointsBefore, 48 ProgramPointsAfterwards, 115 TransitionsBefore, 35 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 1414 VarBasedMoverChecksPositive, 49 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 8816 CheckedPairsTotal, 91 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L847] 0 pthread_t t145; [L848] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] 0 pthread_t t146; [L850] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] 0 pthread_t t147; [L852] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t148; [L854] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L7] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L773] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L793] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L796] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L806] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L816] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L825] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L829] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L832] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 4 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 897 SDtfs, 1860 SDslu, 1772 SDs, 0 SdLazy, 1372 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5832occurred 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: 2.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 3022 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 86808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...