/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/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:35:10,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:35:10,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:35:10,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:35:10,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:35:10,965 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:35:10,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:35:10,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:35:10,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:35:10,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:35:10,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:35:10,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:35:10,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:35:10,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:35:10,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:35:10,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:35:10,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:35:10,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:35:10,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:35:10,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:35:10,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:35:10,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:35:10,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:35:10,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:35:11,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:35:11,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:35:11,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:35:11,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:35:11,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:35:11,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:35:11,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:35:11,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:35:11,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:35:11,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:35:11,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:35:11,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:35:11,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:35:11,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:35:11,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:35:11,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:35:11,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:35:11,017 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:35:11,061 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:35:11,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:35:11,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:35:11,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:35:11,064 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:35:11,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:35:11,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:35:11,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:35:11,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:35:11,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:35:11,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:35:11,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:35:11,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:35:11,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:35:11,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:35:11,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:35:11,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:35:11,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:35:11,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:35:11,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:35:11,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:35:11,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:35:11,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:35:11,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:35:11,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:35:11,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:35:11,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:35:11,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:35:11,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:35:11,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:35:11,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:35:11,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:35:11,369 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:35:11,370 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:35:11,370 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-05 23:35:11,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6147732/a240959170844a789bc72acb7ec34e1f/FLAG06910cea4 [2020-10-05 23:35:11,986 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:35:11,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2020-10-05 23:35:12,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6147732/a240959170844a789bc72acb7ec34e1f/FLAG06910cea4 [2020-10-05 23:35:12,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd6147732/a240959170844a789bc72acb7ec34e1f [2020-10-05 23:35:12,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:35:12,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:35:12,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:12,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:35:12,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:35:12,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:12" (1/1) ... [2020-10-05 23:35:12,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2384cfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:12, skipping insertion in model container [2020-10-05 23:35:12,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:12" (1/1) ... [2020-10-05 23:35:12,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:35:12,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:35:12,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:12,881 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:35:12,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:13,030 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:35:13,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13 WrapperNode [2020-10-05 23:35:13,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:13,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:13,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:35:13,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:35:13,042 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:35:13" (1/1) ... [2020-10-05 23:35:13,062 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:35:13" (1/1) ... [2020-10-05 23:35:13,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:13,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:35:13,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:35:13,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:35:13,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (1/1) ... [2020-10-05 23:35:13,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:35:13,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:35:13,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:35:13,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:35:13,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (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:35:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:35:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:35:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:35:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:35:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:35:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:35:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:35:13,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:35:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:35:13,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:35:13,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:35:13,236 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:35:15,119 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:35:15,119 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:35:15,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:15 BoogieIcfgContainer [2020-10-05 23:35:15,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:35:15,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:35:15,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:35:15,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:35:15,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:35:12" (1/3) ... [2020-10-05 23:35:15,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b869eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:15, skipping insertion in model container [2020-10-05 23:35:15,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:13" (2/3) ... [2020-10-05 23:35:15,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b869eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:15, skipping insertion in model container [2020-10-05 23:35:15,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:15" (3/3) ... [2020-10-05 23:35:15,130 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2020-10-05 23:35:15,141 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:35:15,141 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:35:15,149 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:35:15,150 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:35:15,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,177 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,182 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:15,211 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-05 23:35:15,233 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:35:15,233 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:35:15,233 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:35:15,233 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:35:15,233 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:35:15,233 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:35:15,234 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:35:15,234 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:35:15,249 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-05 23:35:15,251 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-05 23:35:15,290 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-05 23:35:15,291 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:15,295 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:35:15,298 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-05 23:35:15,316 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-05 23:35:15,316 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:15,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-05 23:35:15,319 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 888 [2020-10-05 23:35:15,320 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:35:15,576 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2020-10-05 23:35:17,057 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-05 23:35:17,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-05 23:35:17,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:17,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-05 23:35:17,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:17,964 WARN L193 SmtUtils]: Spent 835.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-05 23:35:18,450 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-05 23:35:19,278 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-05 23:35:19,386 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-05 23:35:19,392 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2408 [2020-10-05 23:35:19,393 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-05 23:35:19,397 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-05 23:35:19,416 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2020-10-05 23:35:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2020-10-05 23:35:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:35:19,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:19,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:35:19,427 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash 861621042, now seen corresponding path program 1 times [2020-10-05 23:35:19,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:19,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612112451] [2020-10-05 23:35:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:19,645 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:35:19,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612112451] [2020-10-05 23:35:19,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:19,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:19,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939800055] [2020-10-05 23:35:19,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:19,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:19,673 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2020-10-05 23:35:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:19,742 INFO L93 Difference]: Finished difference Result 187 states and 450 transitions. [2020-10-05 23:35:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:19,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:35:19,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:19,758 INFO L225 Difference]: With dead ends: 187 [2020-10-05 23:35:19,758 INFO L226 Difference]: Without dead ends: 137 [2020-10-05 23:35:19,760 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:35:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-05 23:35:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-10-05 23:35:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-05 23:35:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2020-10-05 23:35:19,814 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 5 [2020-10-05 23:35:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:19,814 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2020-10-05 23:35:19,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2020-10-05 23:35:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-05 23:35:19,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:19,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:19,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:35:19,817 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1829495527, now seen corresponding path program 1 times [2020-10-05 23:35:19,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:19,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904773455] [2020-10-05 23:35:19,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:20,048 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:35:20,048 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904773455] [2020-10-05 23:35:20,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:20,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:20,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046190438] [2020-10-05 23:35:20,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:20,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:20,051 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand 5 states. [2020-10-05 23:35:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:20,142 INFO L93 Difference]: Finished difference Result 158 states and 350 transitions. [2020-10-05 23:35:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:20,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-05 23:35:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:20,145 INFO L225 Difference]: With dead ends: 158 [2020-10-05 23:35:20,146 INFO L226 Difference]: Without dead ends: 133 [2020-10-05 23:35:20,146 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:35:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-05 23:35:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-10-05 23:35:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-05 23:35:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2020-10-05 23:35:20,159 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 8 [2020-10-05 23:35:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:20,160 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2020-10-05 23:35:20,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2020-10-05 23:35:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:35:20,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:20,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:20,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:35:20,162 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 879762521, now seen corresponding path program 1 times [2020-10-05 23:35:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:20,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472552750] [2020-10-05 23:35:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:20,330 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:35:20,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472552750] [2020-10-05 23:35:20,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:20,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:20,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744626576] [2020-10-05 23:35:20,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:20,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:20,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:20,334 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand 6 states. [2020-10-05 23:35:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:20,455 INFO L93 Difference]: Finished difference Result 145 states and 319 transitions. [2020-10-05 23:35:20,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:20,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-05 23:35:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:20,458 INFO L225 Difference]: With dead ends: 145 [2020-10-05 23:35:20,458 INFO L226 Difference]: Without dead ends: 125 [2020-10-05 23:35:20,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-05 23:35:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-05 23:35:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-05 23:35:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 284 transitions. [2020-10-05 23:35:20,480 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 284 transitions. Word has length 9 [2020-10-05 23:35:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:20,480 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 284 transitions. [2020-10-05 23:35:20,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 284 transitions. [2020-10-05 23:35:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:35:20,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:20,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:20,482 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:35:20,482 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:20,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1831308448, now seen corresponding path program 1 times [2020-10-05 23:35:20,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:20,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612954366] [2020-10-05 23:35:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:20,659 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:35:20,660 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612954366] [2020-10-05 23:35:20,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:20,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:20,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070478667] [2020-10-05 23:35:20,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:20,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:20,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:20,662 INFO L87 Difference]: Start difference. First operand 125 states and 284 transitions. Second operand 6 states. [2020-10-05 23:35:20,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:20,775 INFO L93 Difference]: Finished difference Result 135 states and 296 transitions. [2020-10-05 23:35:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:20,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-05 23:35:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:20,779 INFO L225 Difference]: With dead ends: 135 [2020-10-05 23:35:20,780 INFO L226 Difference]: Without dead ends: 120 [2020-10-05 23:35:20,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-05 23:35:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-05 23:35:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-05 23:35:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 268 transitions. [2020-10-05 23:35:20,790 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 268 transitions. Word has length 10 [2020-10-05 23:35:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:20,790 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 268 transitions. [2020-10-05 23:35:20,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 268 transitions. [2020-10-05 23:35:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:20,791 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:20,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:20,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:35:20,792 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash 935963072, now seen corresponding path program 1 times [2020-10-05 23:35:20,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:20,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641407309] [2020-10-05 23:35:20,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:20,924 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:35:20,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641407309] [2020-10-05 23:35:20,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:20,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:20,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765381900] [2020-10-05 23:35:20,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:20,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:20,927 INFO L87 Difference]: Start difference. First operand 119 states and 268 transitions. Second operand 7 states. [2020-10-05 23:35:21,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:21,090 INFO L93 Difference]: Finished difference Result 143 states and 311 transitions. [2020-10-05 23:35:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:21,091 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-05 23:35:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:21,092 INFO L225 Difference]: With dead ends: 143 [2020-10-05 23:35:21,092 INFO L226 Difference]: Without dead ends: 127 [2020-10-05 23:35:21,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:35:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-10-05 23:35:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-10-05 23:35:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-05 23:35:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 282 transitions. [2020-10-05 23:35:21,106 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 282 transitions. Word has length 11 [2020-10-05 23:35:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:21,107 INFO L479 AbstractCegarLoop]: Abstraction has 127 states and 282 transitions. [2020-10-05 23:35:21,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 282 transitions. [2020-10-05 23:35:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:21,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:21,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:21,112 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:35:21,112 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:21,112 INFO L82 PathProgramCache]: Analyzing trace with hash -657848166, now seen corresponding path program 1 times [2020-10-05 23:35:21,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:21,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996160248] [2020-10-05 23:35:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:21,272 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:35:21,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996160248] [2020-10-05 23:35:21,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:21,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111021438] [2020-10-05 23:35:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:21,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:21,276 INFO L87 Difference]: Start difference. First operand 127 states and 282 transitions. Second operand 4 states. [2020-10-05 23:35:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:21,303 INFO L93 Difference]: Finished difference Result 108 states and 202 transitions. [2020-10-05 23:35:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:21,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-05 23:35:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:21,310 INFO L225 Difference]: With dead ends: 108 [2020-10-05 23:35:21,310 INFO L226 Difference]: Without dead ends: 79 [2020-10-05 23:35:21,311 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:35:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-05 23:35:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-05 23:35:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-05 23:35:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 138 transitions. [2020-10-05 23:35:21,319 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 138 transitions. Word has length 11 [2020-10-05 23:35:21,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:21,320 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 138 transitions. [2020-10-05 23:35:21,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 138 transitions. [2020-10-05 23:35:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:21,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:21,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:21,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:35:21,327 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:21,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1314571888, now seen corresponding path program 1 times [2020-10-05 23:35:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:21,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936851584] [2020-10-05 23:35:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:21,477 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:35:21,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936851584] [2020-10-05 23:35:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:21,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:21,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487795483] [2020-10-05 23:35:21,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:21,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:21,480 INFO L87 Difference]: Start difference. First operand 79 states and 138 transitions. Second operand 5 states. [2020-10-05 23:35:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:21,516 INFO L93 Difference]: Finished difference Result 56 states and 90 transitions. [2020-10-05 23:35:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:21,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-05 23:35:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:21,517 INFO L225 Difference]: With dead ends: 56 [2020-10-05 23:35:21,518 INFO L226 Difference]: Without dead ends: 45 [2020-10-05 23:35:21,518 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:35:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-05 23:35:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-10-05 23:35:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-05 23:35:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-10-05 23:35:21,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 12 [2020-10-05 23:35:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:21,521 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-10-05 23:35:21,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-10-05 23:35:21,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:21,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:21,524 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:35:21,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:35:21,524 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash -299715963, now seen corresponding path program 1 times [2020-10-05 23:35:21,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:21,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701653417] [2020-10-05 23:35:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:21,725 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:35:21,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701653417] [2020-10-05 23:35:21,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:21,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:35:21,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7218360] [2020-10-05 23:35:21,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:35:21,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:35:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:21,734 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 8 states. [2020-10-05 23:35:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:21,873 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2020-10-05 23:35:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:21,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:35:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:21,875 INFO L225 Difference]: With dead ends: 60 [2020-10-05 23:35:21,875 INFO L226 Difference]: Without dead ends: 29 [2020-10-05 23:35:21,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:35:21,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-05 23:35:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-05 23:35:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-05 23:35:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-05 23:35:21,879 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2020-10-05 23:35:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:21,879 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-05 23:35:21,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:35:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-05 23:35:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:21,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:21,880 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:35:21,880 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:35:21,880 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:21,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1056418205, now seen corresponding path program 2 times [2020-10-05 23:35:21,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:21,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463978382] [2020-10-05 23:35:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:21,981 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:35:21,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463978382] [2020-10-05 23:35:21,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:21,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:21,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969018770] [2020-10-05 23:35:21,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:21,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:21,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:21,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:21,984 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 7 states. [2020-10-05 23:35:22,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:22,048 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-05 23:35:22,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:22,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:35:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:22,050 INFO L225 Difference]: With dead ends: 44 [2020-10-05 23:35:22,050 INFO L226 Difference]: Without dead ends: 25 [2020-10-05 23:35:22,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:35:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-05 23:35:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-05 23:35:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-05 23:35:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-10-05 23:35:22,052 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2020-10-05 23:35:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:22,053 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-10-05 23:35:22,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-10-05 23:35:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:22,053 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:22,053 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:35:22,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:35:22,054 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:22,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:22,054 INFO L82 PathProgramCache]: Analyzing trace with hash -869615873, now seen corresponding path program 3 times [2020-10-05 23:35:22,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:22,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838223955] [2020-10-05 23:35:22,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:22,190 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:35:22,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838223955] [2020-10-05 23:35:22,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:22,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:22,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473145120] [2020-10-05 23:35:22,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:22,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:22,193 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 7 states. [2020-10-05 23:35:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:22,262 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2020-10-05 23:35:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:22,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-05 23:35:22,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:22,263 INFO L225 Difference]: With dead ends: 34 [2020-10-05 23:35:22,263 INFO L226 Difference]: Without dead ends: 21 [2020-10-05 23:35:22,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-10-05 23:35:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-05 23:35:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-05 23:35:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-10-05 23:35:22,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2020-10-05 23:35:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:22,265 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-10-05 23:35:22,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-10-05 23:35:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:22,266 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:22,266 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:35:22,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:35:22,266 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1239204549, now seen corresponding path program 4 times [2020-10-05 23:35:22,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:22,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544870102] [2020-10-05 23:35:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:22,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:22,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:22,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:35:22,366 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:35:22,366 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:35:22,381 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:35:22,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,382 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:35:22,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,383 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:35:22,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,383 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:35:22,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,384 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:35:22,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,384 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:35:22,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,385 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:35:22,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,385 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:35:22,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,385 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:35:22,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,386 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:35:22,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,386 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:35:22,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,386 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:35:22,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,387 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:35:22,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,388 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:35:22,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,388 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:35:22,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,388 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:35:22,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,389 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:35:22,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,389 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:35:22,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,390 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:35:22,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,390 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:35:22,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,391 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:35:22,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,391 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:35:22,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,391 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:35:22,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,392 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:35:22,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,392 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:35:22,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,392 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:35:22,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,393 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:35:22,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,393 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:35:22,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,393 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:35:22,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:22,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:35:22 BasicIcfg [2020-10-05 23:35:22,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:35:22,447 INFO L168 Benchmark]: Toolchain (without parser) took 10148.28 ms. Allocated memory was 141.6 MB in the beginning and 323.0 MB in the end (delta: 181.4 MB). Free memory was 103.4 MB in the beginning and 244.1 MB in the end (delta: -140.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,448 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.53 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 102.9 MB in the beginning and 159.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 156.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,452 INFO L168 Benchmark]: Boogie Preprocessor took 38.23 ms. Allocated memory is still 205.0 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,454 INFO L168 Benchmark]: RCFGBuilder took 1983.55 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 154.0 MB in the beginning and 188.6 MB in the end (delta: -34.6 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,456 INFO L168 Benchmark]: TraceAbstraction took 7321.35 ms. Allocated memory was 244.8 MB in the beginning and 323.0 MB in the end (delta: 78.1 MB). Free memory was 188.6 MB in the beginning and 244.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:22,471 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.53 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 102.9 MB in the beginning and 159.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 205.0 MB. Free memory was 159.6 MB in the beginning and 156.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.23 ms. Allocated memory is still 205.0 MB. Free memory was 156.8 MB in the beginning and 154.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1983.55 ms. Allocated memory was 205.0 MB in the beginning and 244.8 MB in the end (delta: 39.8 MB). Free memory was 154.0 MB in the beginning and 188.6 MB in the end (delta: -34.6 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7321.35 ms. Allocated memory was 244.8 MB in the beginning and 323.0 MB in the end (delta: 78.1 MB). Free memory was 188.6 MB in the beginning and 244.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 80 ProgramPointsBefore, 28 ProgramPointsAfterwards, 75 TransitionsBefore, 22 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 424 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2408 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L704] 0 _Bool x$flush_delayed; [L705] 0 int x$mem_tmp; [L706] 0 _Bool x$r_buff0_thd0; [L707] 0 _Bool x$r_buff0_thd1; [L708] 0 _Bool x$r_buff0_thd2; [L709] 0 _Bool x$r_buff1_thd0; [L710] 0 _Bool x$r_buff1_thd1; [L711] 0 _Bool x$r_buff1_thd2; [L712] 0 _Bool x$read_delayed; [L713] 0 int *x$read_delayed_var; [L714] 0 int x$w_buff0; [L715] 0 _Bool x$w_buff0_used; [L716] 0 int x$w_buff1; [L717] 0 _Bool x$w_buff1_used; [L719] 0 int y = 0; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t1453; [L782] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L783] 0 pthread_t t1454; [L784] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L745] 2 x$w_buff1 = x$w_buff0 [L746] 2 x$w_buff0 = 2 [L747] 2 x$w_buff1_used = x$w_buff0_used [L748] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L750] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L751] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L752] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L753] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L725] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L728] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L759] 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) [L759] 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) [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L760] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L761] 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 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L763] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 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 [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L731] 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) [L731] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L731] 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) [L731] 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) [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L732] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 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 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 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 [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L3] COND FALSE 0 !(!cond) [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L790] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L791] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L792] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L793] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L794] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 x$flush_delayed = weak$$choice2 [L800] 0 x$mem_tmp = x [L801] 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) [L801] 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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 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)) [L806] 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) [L806] 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)) [L806] 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)) [L807] 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)) [L807] EXPR 0 !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) [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L807] EXPR 0 !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) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L809] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L809] 0 x = x$flush_delayed ? x$mem_tmp : x [L810] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 164 SDtfs, 229 SDslu, 326 SDs, 0 SdLazy, 259 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 10081 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...