/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/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:01:28,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:01:28,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:01:28,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:01:28,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:01:28,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:01:28,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:01:28,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:01:28,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:01:28,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:01:28,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:01:28,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:01:28,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:01:28,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:01:28,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:01:28,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:01:28,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:01:28,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:01:28,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:01:28,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:01:28,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:01:28,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:01:28,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:01:28,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:01:28,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:01:28,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:01:28,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:01:28,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:01:28,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:01:28,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:01:28,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:01:28,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:01:28,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:01:28,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:01:28,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:01:28,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:01:28,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:01:28,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:01:28,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:01:28,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:01:28,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:01:28,106 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-21 23:01:28,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:01:28,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:01:28,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:01:28,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:01:28,162 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:01:28,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:01:28,163 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:01:28,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:01:28,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:01:28,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:01:28,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:01:28,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:01:28,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:01:28,164 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:01:28,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:01:28,164 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:01:28,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:01:28,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:01:28,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:01:28,167 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:01:28,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:01:28,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:01:28,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:01:28,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:01:28,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:01:28,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:01:28,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:01:28,169 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:01:28,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:01:28,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:01:28,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:01:28,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:01:28,515 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:01:28,516 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:01:28,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-21 23:01:28,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6293e56/745c9d5bacc842eba53b433f243f9b03/FLAG70d1c5078 [2020-10-21 23:01:29,072 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:01:29,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2020-10-21 23:01:29,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6293e56/745c9d5bacc842eba53b433f243f9b03/FLAG70d1c5078 [2020-10-21 23:01:29,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c6293e56/745c9d5bacc842eba53b433f243f9b03 [2020-10-21 23:01:29,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:01:29,415 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:01:29,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:29,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:01:29,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:01:29,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:29" (1/1) ... [2020-10-21 23:01:29,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38bf2dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:29, skipping insertion in model container [2020-10-21 23:01:29,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:01:29" (1/1) ... [2020-10-21 23:01:29,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:01:29,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:01:30,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:30,118 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:01:30,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:01:30,272 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:01:30,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30 WrapperNode [2020-10-21 23:01:30,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:01:30,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:30,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:01:30,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:01:30,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:01:30,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:01:30,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:01:30,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:01:30,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (1/1) ... [2020-10-21 23:01:30,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:01:30,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:01:30,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:01:30,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:01:30,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (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-21 23:01:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:01:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:01:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:01:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:01:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:01:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:01:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:01:30,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:01:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 23:01:30,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 23:01:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 23:01:30,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 23:01:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:01:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:01:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:01:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:01:30,503 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 23:01:32,493 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:01:32,494 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:01:32,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:32 BoogieIcfgContainer [2020-10-21 23:01:32,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:01:32,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:01:32,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:01:32,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:01:32,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:01:29" (1/3) ... [2020-10-21 23:01:32,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c71d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:32, skipping insertion in model container [2020-10-21 23:01:32,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:01:30" (2/3) ... [2020-10-21 23:01:32,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c71d0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:01:32, skipping insertion in model container [2020-10-21 23:01:32,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:01:32" (3/3) ... [2020-10-21 23:01:32,505 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2020-10-21 23:01:32,518 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:01:32,518 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:01:32,526 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:01:32,527 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:01:32,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,558 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,558 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,559 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,561 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,561 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,566 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,572 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,574 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,580 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,584 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,584 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,585 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,585 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,586 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:01:32,587 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:01:32,601 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 23:01:32,622 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:01:32,623 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:01:32,623 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:01:32,623 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:01:32,623 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:01:32,623 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:01:32,623 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:01:32,624 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:01:32,638 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:01:32,638 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:32,641 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:32,643 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-10-21 23:01:32,699 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-10-21 23:01:32,699 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:01:32,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-21 23:01:32,709 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-10-21 23:01:34,376 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 23:01:34,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-21 23:01:34,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:34,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-21 23:01:34,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:01:35,333 WARN L193 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-21 23:01:36,282 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 23:01:38,064 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-21 23:01:38,379 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-21 23:01:39,074 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 108 [2020-10-21 23:01:39,381 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-21 23:01:40,538 WARN L193 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 135 [2020-10-21 23:01:40,947 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-21 23:01:41,366 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-21 23:01:41,568 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-21 23:01:41,622 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-10-21 23:01:41,622 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-10-21 23:01:41,629 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-21 23:01:41,791 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-21 23:01:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-21 23:01:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:01:41,808 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:41,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:41,809 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-10-21 23:01:41,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:41,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789183024] [2020-10-21 23:01:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:42,181 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-21 23:01:42,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789183024] [2020-10-21 23:01:42,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:42,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:42,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14810824] [2020-10-21 23:01:42,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:42,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:42,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:42,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:42,210 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-21 23:01:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:42,341 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-21 23:01:42,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:42,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:01:42,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:42,396 INFO L225 Difference]: With dead ends: 2202 [2020-10-21 23:01:42,397 INFO L226 Difference]: Without dead ends: 1802 [2020-10-21 23:01:42,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-21 23:01:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-21 23:01:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-21 23:01:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-21 23:01:42,580 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-21 23:01:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:42,582 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-21 23:01:42,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-21 23:01:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:01:42,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:42,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:42,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:01:42,586 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-10-21 23:01:42,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:42,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386798691] [2020-10-21 23:01:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:42,761 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-21 23:01:42,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386798691] [2020-10-21 23:01:42,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:42,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:01:42,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466824133] [2020-10-21 23:01:42,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:01:42,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:01:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:01:42,765 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-21 23:01:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:42,816 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-10-21 23:01:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:01:42,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-21 23:01:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:42,831 INFO L225 Difference]: With dead ends: 1792 [2020-10-21 23:01:42,832 INFO L226 Difference]: Without dead ends: 1792 [2020-10-21 23:01:42,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 23:01:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-10-21 23:01:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-10-21 23:01:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-10-21 23:01:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-10-21 23:01:42,903 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-10-21 23:01:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:42,904 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-10-21 23:01:42,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:01:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-10-21 23:01:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:42,907 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:42,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:42,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:01:42,907 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-10-21 23:01:42,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:42,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108253334] [2020-10-21 23:01:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:43,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:01:43,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108253334] [2020-10-21 23:01:43,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:43,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:43,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227830653] [2020-10-21 23:01:43,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:43,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:43,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:43,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:43,038 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-10-21 23:01:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:43,107 INFO L93 Difference]: Finished difference Result 1764 states and 6612 transitions. [2020-10-21 23:01:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:43,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:01:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:43,123 INFO L225 Difference]: With dead ends: 1764 [2020-10-21 23:01:43,123 INFO L226 Difference]: Without dead ends: 1764 [2020-10-21 23:01:43,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2020-10-21 23:01:43,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2020-10-21 23:01:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2020-10-21 23:01:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 6612 transitions. [2020-10-21 23:01:43,194 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 6612 transitions. Word has length 12 [2020-10-21 23:01:43,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:43,194 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 6612 transitions. [2020-10-21 23:01:43,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 6612 transitions. [2020-10-21 23:01:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:01:43,196 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:43,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:43,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:01:43,197 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1849246298, now seen corresponding path program 1 times [2020-10-21 23:01:43,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:43,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22555279] [2020-10-21 23:01:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:43,281 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-21 23:01:43,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22555279] [2020-10-21 23:01:43,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:43,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:43,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391169209] [2020-10-21 23:01:43,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:43,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:43,286 INFO L87 Difference]: Start difference. First operand 1764 states and 6612 transitions. Second operand 4 states. [2020-10-21 23:01:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:43,391 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-10-21 23:01:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:43,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:01:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:43,410 INFO L225 Difference]: With dead ends: 1724 [2020-10-21 23:01:43,411 INFO L226 Difference]: Without dead ends: 1724 [2020-10-21 23:01:43,411 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-21 23:01:43,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-10-21 23:01:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-10-21 23:01:43,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-10-21 23:01:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-10-21 23:01:43,477 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-10-21 23:01:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:43,477 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-10-21 23:01:43,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-10-21 23:01:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:01:43,479 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:43,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:43,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:01:43,480 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-10-21 23:01:43,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:43,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69272456] [2020-10-21 23:01:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:43,615 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-21 23:01:43,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69272456] [2020-10-21 23:01:43,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:43,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:43,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952879599] [2020-10-21 23:01:43,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:43,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:43,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:43,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:43,618 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 5 states. [2020-10-21 23:01:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:43,722 INFO L93 Difference]: Finished difference Result 1668 states and 6182 transitions. [2020-10-21 23:01:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:43,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-21 23:01:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:43,748 INFO L225 Difference]: With dead ends: 1668 [2020-10-21 23:01:43,749 INFO L226 Difference]: Without dead ends: 1668 [2020-10-21 23:01:43,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-10-21 23:01:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-10-21 23:01:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-10-21 23:01:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 6182 transitions. [2020-10-21 23:01:43,819 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 6182 transitions. Word has length 13 [2020-10-21 23:01:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:43,819 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 6182 transitions. [2020-10-21 23:01:43,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 6182 transitions. [2020-10-21 23:01:43,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:01:43,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:43,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:43,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:01:43,823 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:43,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:43,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2110987523, now seen corresponding path program 1 times [2020-10-21 23:01:43,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:43,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387851527] [2020-10-21 23:01:43,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:43,964 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-21 23:01:43,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387851527] [2020-10-21 23:01:43,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:43,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:43,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929314902] [2020-10-21 23:01:43,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:43,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:43,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:43,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:43,966 INFO L87 Difference]: Start difference. First operand 1668 states and 6182 transitions. Second operand 4 states. [2020-10-21 23:01:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,020 INFO L93 Difference]: Finished difference Result 1750 states and 6430 transitions. [2020-10-21 23:01:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:44,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 23:01:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,036 INFO L225 Difference]: With dead ends: 1750 [2020-10-21 23:01:44,037 INFO L226 Difference]: Without dead ends: 1750 [2020-10-21 23:01:44,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2020-10-21 23:01:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1722. [2020-10-21 23:01:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-21 23:01:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6348 transitions. [2020-10-21 23:01:44,142 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6348 transitions. Word has length 14 [2020-10-21 23:01:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,142 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6348 transitions. [2020-10-21 23:01:44,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6348 transitions. [2020-10-21 23:01:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:01:44,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:01:44,146 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-10-21 23:01:44,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487731007] [2020-10-21 23:01:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,218 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-21 23:01:44,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487731007] [2020-10-21 23:01:44,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:44,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707416287] [2020-10-21 23:01:44,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:44,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:44,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:44,220 INFO L87 Difference]: Start difference. First operand 1722 states and 6348 transitions. Second operand 4 states. [2020-10-21 23:01:44,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,273 INFO L93 Difference]: Finished difference Result 1799 states and 6062 transitions. [2020-10-21 23:01:44,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:01:44,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 23:01:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,285 INFO L225 Difference]: With dead ends: 1799 [2020-10-21 23:01:44,285 INFO L226 Difference]: Without dead ends: 1367 [2020-10-21 23:01:44,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-10-21 23:01:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2020-10-21 23:01:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2020-10-21 23:01:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 4573 transitions. [2020-10-21 23:01:44,328 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 4573 transitions. Word has length 15 [2020-10-21 23:01:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,328 INFO L481 AbstractCegarLoop]: Abstraction has 1367 states and 4573 transitions. [2020-10-21 23:01:44,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 4573 transitions. [2020-10-21 23:01:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:01:44,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:01:44,331 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash -75162851, now seen corresponding path program 1 times [2020-10-21 23:01:44,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757066314] [2020-10-21 23:01:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,408 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-21 23:01:44,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757066314] [2020-10-21 23:01:44,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:01:44,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725423714] [2020-10-21 23:01:44,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:44,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:44,412 INFO L87 Difference]: Start difference. First operand 1367 states and 4573 transitions. Second operand 5 states. [2020-10-21 23:01:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,481 INFO L93 Difference]: Finished difference Result 1182 states and 3624 transitions. [2020-10-21 23:01:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:44,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-21 23:01:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,489 INFO L225 Difference]: With dead ends: 1182 [2020-10-21 23:01:44,489 INFO L226 Difference]: Without dead ends: 903 [2020-10-21 23:01:44,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:44,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-10-21 23:01:44,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2020-10-21 23:01:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2020-10-21 23:01:44,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2717 transitions. [2020-10-21 23:01:44,516 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2717 transitions. Word has length 16 [2020-10-21 23:01:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,516 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 2717 transitions. [2020-10-21 23:01:44,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2717 transitions. [2020-10-21 23:01:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:01:44,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:01:44,519 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,520 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-10-21 23:01:44,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640973762] [2020-10-21 23:01:44,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,579 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-21 23:01:44,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640973762] [2020-10-21 23:01:44,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:44,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835373860] [2020-10-21 23:01:44,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:44,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:44,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:44,582 INFO L87 Difference]: Start difference. First operand 903 states and 2717 transitions. Second operand 4 states. [2020-10-21 23:01:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,608 INFO L93 Difference]: Finished difference Result 1254 states and 3688 transitions. [2020-10-21 23:01:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:44,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-21 23:01:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,615 INFO L225 Difference]: With dead ends: 1254 [2020-10-21 23:01:44,616 INFO L226 Difference]: Without dead ends: 924 [2020-10-21 23:01:44,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2020-10-21 23:01:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 903. [2020-10-21 23:01:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2020-10-21 23:01:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 2637 transitions. [2020-10-21 23:01:44,642 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 2637 transitions. Word has length 18 [2020-10-21 23:01:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,642 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 2637 transitions. [2020-10-21 23:01:44,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 2637 transitions. [2020-10-21 23:01:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:01:44,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:01:44,645 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1933425320, now seen corresponding path program 1 times [2020-10-21 23:01:44,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849764255] [2020-10-21 23:01:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,701 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-21 23:01:44,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849764255] [2020-10-21 23:01:44,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:44,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81450770] [2020-10-21 23:01:44,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:44,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:44,704 INFO L87 Difference]: Start difference. First operand 903 states and 2637 transitions. Second operand 4 states. [2020-10-21 23:01:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,759 INFO L93 Difference]: Finished difference Result 1022 states and 2976 transitions. [2020-10-21 23:01:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:44,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-21 23:01:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,764 INFO L225 Difference]: With dead ends: 1022 [2020-10-21 23:01:44,764 INFO L226 Difference]: Without dead ends: 1022 [2020-10-21 23:01:44,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2020-10-21 23:01:44,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1020. [2020-10-21 23:01:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2020-10-21 23:01:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2973 transitions. [2020-10-21 23:01:44,792 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2973 transitions. Word has length 18 [2020-10-21 23:01:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:44,793 INFO L481 AbstractCegarLoop]: Abstraction has 1020 states and 2973 transitions. [2020-10-21 23:01:44,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2973 transitions. [2020-10-21 23:01:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:01:44,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:44,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:44,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:01:44,796 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:44,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:44,797 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-10-21 23:01:44,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:44,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723292096] [2020-10-21 23:01:44,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:44,899 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-21 23:01:44,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723292096] [2020-10-21 23:01:44,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:44,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:01:44,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775574329] [2020-10-21 23:01:44,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:01:44,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:44,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:01:44,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:44,903 INFO L87 Difference]: Start difference. First operand 1020 states and 2973 transitions. Second operand 6 states. [2020-10-21 23:01:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:44,987 INFO L93 Difference]: Finished difference Result 889 states and 2553 transitions. [2020-10-21 23:01:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:01:44,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-21 23:01:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:44,993 INFO L225 Difference]: With dead ends: 889 [2020-10-21 23:01:44,993 INFO L226 Difference]: Without dead ends: 785 [2020-10-21 23:01:44,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2020-10-21 23:01:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2020-10-21 23:01:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-10-21 23:01:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2286 transitions. [2020-10-21 23:01:45,016 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2286 transitions. Word has length 18 [2020-10-21 23:01:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,017 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 2286 transitions. [2020-10-21 23:01:45,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:01:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2286 transitions. [2020-10-21 23:01:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:01:45,019 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:01:45,020 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,020 INFO L82 PathProgramCache]: Analyzing trace with hash -7634442, now seen corresponding path program 1 times [2020-10-21 23:01:45,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106868804] [2020-10-21 23:01:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,133 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-21 23:01:45,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106868804] [2020-10-21 23:01:45,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:01:45,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162931010] [2020-10-21 23:01:45,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:01:45,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:01:45,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:01:45,135 INFO L87 Difference]: Start difference. First operand 785 states and 2286 transitions. Second operand 5 states. [2020-10-21 23:01:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,195 INFO L93 Difference]: Finished difference Result 784 states and 2284 transitions. [2020-10-21 23:01:45,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:45,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-21 23:01:45,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,199 INFO L225 Difference]: With dead ends: 784 [2020-10-21 23:01:45,199 INFO L226 Difference]: Without dead ends: 784 [2020-10-21 23:01:45,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:01:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-10-21 23:01:45,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 680. [2020-10-21 23:01:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2020-10-21 23:01:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1987 transitions. [2020-10-21 23:01:45,218 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1987 transitions. Word has length 21 [2020-10-21 23:01:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,218 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 1987 transitions. [2020-10-21 23:01:45,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:01:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1987 transitions. [2020-10-21 23:01:45,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:01:45,221 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,221 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:01:45,221 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,222 INFO L82 PathProgramCache]: Analyzing trace with hash 934914416, now seen corresponding path program 1 times [2020-10-21 23:01:45,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839548137] [2020-10-21 23:01:45,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,285 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-21 23:01:45,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839548137] [2020-10-21 23:01:45,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:01:45,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630903722] [2020-10-21 23:01:45,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:01:45,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:01:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:45,287 INFO L87 Difference]: Start difference. First operand 680 states and 1987 transitions. Second operand 4 states. [2020-10-21 23:01:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,314 INFO L93 Difference]: Finished difference Result 941 states and 2655 transitions. [2020-10-21 23:01:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:01:45,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-21 23:01:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,317 INFO L225 Difference]: With dead ends: 941 [2020-10-21 23:01:45,317 INFO L226 Difference]: Without dead ends: 615 [2020-10-21 23:01:45,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:01:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2020-10-21 23:01:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 601. [2020-10-21 23:01:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2020-10-21 23:01:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1603 transitions. [2020-10-21 23:01:45,341 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1603 transitions. Word has length 21 [2020-10-21 23:01:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,343 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 1603 transitions. [2020-10-21 23:01:45,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:01:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1603 transitions. [2020-10-21 23:01:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 23:01:45,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:01:45,346 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-10-21 23:01:45,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268597890] [2020-10-21 23:01:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,529 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-21 23:01:45,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268597890] [2020-10-21 23:01:45,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:01:45,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504830230] [2020-10-21 23:01:45,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:01:45,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:01:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:45,534 INFO L87 Difference]: Start difference. First operand 601 states and 1603 transitions. Second operand 7 states. [2020-10-21 23:01:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,620 INFO L93 Difference]: Finished difference Result 575 states and 1551 transitions. [2020-10-21 23:01:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:01:45,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-21 23:01:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,622 INFO L225 Difference]: With dead ends: 575 [2020-10-21 23:01:45,623 INFO L226 Difference]: Without dead ends: 199 [2020-10-21 23:01:45,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:01:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-10-21 23:01:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2020-10-21 23:01:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-21 23:01:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2020-10-21 23:01:45,629 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2020-10-21 23:01:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,629 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2020-10-21 23:01:45,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:01:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2020-10-21 23:01:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:01:45,630 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:01:45,631 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 1 times [2020-10-21 23:01:45,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355859332] [2020-10-21 23:01:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:01:45,787 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-21 23:01:45,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355859332] [2020-10-21 23:01:45,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:01:45,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:01:45,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903606969] [2020-10-21 23:01:45,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:01:45,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:01:45,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:01:45,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:01:45,789 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand 7 states. [2020-10-21 23:01:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:01:45,913 INFO L93 Difference]: Finished difference Result 241 states and 589 transitions. [2020-10-21 23:01:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:01:45,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-21 23:01:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:01:45,915 INFO L225 Difference]: With dead ends: 241 [2020-10-21 23:01:45,915 INFO L226 Difference]: Without dead ends: 139 [2020-10-21 23:01:45,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:01:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-21 23:01:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-10-21 23:01:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-21 23:01:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 317 transitions. [2020-10-21 23:01:45,920 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 317 transitions. Word has length 25 [2020-10-21 23:01:45,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:01:45,921 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 317 transitions. [2020-10-21 23:01:45,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:01:45,921 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 317 transitions. [2020-10-21 23:01:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 23:01:45,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:01:45,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:01:45,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:01:45,922 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:01:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:01:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 2 times [2020-10-21 23:01:45,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:01:45,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997780165] [2020-10-21 23:01:45,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:01:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:45,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:01:46,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:01:46,042 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:01:46,043 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:01:46,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:01:46,044 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:01:46,060 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L847-->L854: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In-1111810683 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In-1111810683 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-1111810683 256) 0)) (.cse9 (= 0 (mod ~z$w_buff0_used~0_In-1111810683 256)))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out-1111810683 ~z$r_buff0_thd0~0_In-1111810683) (or (and (= ~z$w_buff0_used~0_In-1111810683 ~z$w_buff0_used~0_Out-1111810683) .cse0) (and (= ~z$w_buff0_used~0_Out-1111810683 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1111810683 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1111810683| ULTIMATE.start_assume_abort_if_not_~cond_Out-1111810683) (= ~z$r_buff1_thd0~0_In-1111810683 ~z$r_buff1_thd0~0_Out-1111810683) (or (and .cse1 (= ~z$w_buff0~0_In-1111810683 ~z~0_Out-1111810683) .cse2) (and (or (and (= ~z~0_In-1111810683 ~z~0_Out-1111810683) .cse3) (and .cse4 .cse5 (= ~z$w_buff1~0_In-1111810683 ~z~0_Out-1111810683))) .cse0)) (or (and .cse4 .cse5 (= ~z$w_buff1_used~0_Out-1111810683 0)) (and (= ~z$w_buff1_used~0_Out-1111810683 ~z$w_buff1_used~0_In-1111810683) .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1111810683|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1111810683, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1111810683, ~z$w_buff0~0=~z$w_buff0~0_In-1111810683, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1111810683, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1111810683, ~z$w_buff1~0=~z$w_buff1~0_In-1111810683, ~z~0=~z~0_In-1111810683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1111810683, ~z$w_buff0~0=~z$w_buff0~0_In-1111810683, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1111810683, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1111810683|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1111810683|, ~z$w_buff1~0=~z$w_buff1~0_In-1111810683, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1111810683|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1111810683|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1111810683|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1111810683|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1111810683|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-1111810683, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1111810683, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1111810683, ~z~0=~z~0_Out-1111810683} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ~z~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:01:46,068 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-21 23:01:46,069 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [797] [2020-10-21 23:01:46,071 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-21 23:01:46,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,071 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-21 23:01:46,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,072 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-21 23:01:46,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,072 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-21 23:01:46,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,072 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-21 23:01:46,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,073 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-21 23:01:46,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,074 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-21 23:01:46,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,074 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-21 23:01:46,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,074 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-21 23:01:46,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,075 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-21 23:01:46,075 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,076 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-21 23:01:46,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,076 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-21 23:01:46,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,076 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-21 23:01:46,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,077 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-21 23:01:46,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,077 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-21 23:01:46,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,077 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-21 23:01:46,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,078 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-21 23:01:46,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,078 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-21 23:01:46,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,079 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-21 23:01:46,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,079 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-21 23:01:46,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,079 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-21 23:01:46,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,080 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-21 23:01:46,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,080 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-21 23:01:46,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,080 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-21 23:01:46,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:01:46,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:01:46 BasicIcfg [2020-10-21 23:01:46,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:01:46,157 INFO L168 Benchmark]: Toolchain (without parser) took 16748.30 ms. Allocated memory was 140.0 MB in the beginning and 396.9 MB in the end (delta: 256.9 MB). Free memory was 101.1 MB in the beginning and 222.5 MB in the end (delta: -121.4 MB). Peak memory consumption was 135.5 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,158 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 856.80 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.2 MB in the end (delta: -54.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,161 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 150.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,161 INFO L168 Benchmark]: Boogie Preprocessor took 80.77 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,162 INFO L168 Benchmark]: RCFGBuilder took 2073.55 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 148.1 MB in the beginning and 175.8 MB in the end (delta: -27.7 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,163 INFO L168 Benchmark]: TraceAbstraction took 13657.84 ms. Allocated memory was 246.4 MB in the beginning and 396.9 MB in the end (delta: 150.5 MB). Free memory was 175.8 MB in the beginning and 222.5 MB in the end (delta: -46.7 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. [2020-10-21 23:01:46,169 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 856.80 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.2 MB in the end (delta: -54.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 150.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.77 ms. Allocated memory is still 203.9 MB. Free memory was 150.8 MB in the beginning and 148.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2073.55 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 148.1 MB in the beginning and 175.8 MB in the end (delta: -27.7 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13657.84 ms. Allocated memory was 246.4 MB in the beginning and 396.9 MB in the end (delta: 150.5 MB). Free memory was 175.8 MB in the beginning and 222.5 MB in the end (delta: -46.7 MB). Peak memory consumption was 103.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1410 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.9s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1477; [L837] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1478; [L839] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1479; [L841] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1480; [L843] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 444 SDtfs, 465 SDslu, 687 SDs, 0 SdLazy, 336 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 189 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 25457 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...