/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 23:08:18,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 23:08:18,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 23:08:18,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 23:08:18,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 23:08:18,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 23:08:18,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 23:08:18,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 23:08:18,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 23:08:18,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 23:08:18,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 23:08:18,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 23:08:18,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 23:08:18,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 23:08:18,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 23:08:18,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 23:08:18,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 23:08:18,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 23:08:18,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 23:08:18,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 23:08:18,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 23:08:18,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 23:08:18,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 23:08:18,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 23:08:18,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 23:08:18,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 23:08:18,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 23:08:18,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 23:08:18,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 23:08:18,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 23:08:18,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 23:08:18,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 23:08:18,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 23:08:18,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 23:08:18,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 23:08:18,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 23:08:18,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 23:08:18,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 23:08:18,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 23:08:18,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 23:08:18,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 23:08:18,136 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:08:18,172 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 23:08:18,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 23:08:18,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 23:08:18,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 23:08:18,175 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 23:08:18,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 23:08:18,175 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 23:08:18,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 23:08:18,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 23:08:18,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 23:08:18,177 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 23:08:18,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 23:08:18,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 23:08:18,178 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 23:08:18,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 23:08:18,179 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 23:08:18,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 23:08:18,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 23:08:18,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 23:08:18,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 23:08:18,181 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 23:08:18,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 23:08:18,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 23:08:18,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 23:08:18,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 23:08:18,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 23:08:18,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 23:08:18,186 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 23:08:18,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 23:08:18,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 23:08:18,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 23:08:18,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 23:08:18,498 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 23:08:18,498 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 23:08:18,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-21 23:08:18,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f48f617c/842948724fec4956b9a1def7f0380b97/FLAG2cc793948 [2020-10-21 23:08:19,240 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 23:08:19,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-10-21 23:08:19,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f48f617c/842948724fec4956b9a1def7f0380b97/FLAG2cc793948 [2020-10-21 23:08:19,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f48f617c/842948724fec4956b9a1def7f0380b97 [2020-10-21 23:08:19,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 23:08:19,505 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 23:08:19,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 23:08:19,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 23:08:19,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 23:08:19,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:08:19" (1/1) ... [2020-10-21 23:08:19,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47acfa1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:19, skipping insertion in model container [2020-10-21 23:08:19,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 11:08:19" (1/1) ... [2020-10-21 23:08:19,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 23:08:19,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 23:08:20,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:08:20,022 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 23:08:20,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 23:08:20,206 INFO L208 MainTranslator]: Completed translation [2020-10-21 23:08:20,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20 WrapperNode [2020-10-21 23:08:20,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 23:08:20,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 23:08:20,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 23:08:20,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 23:08:20,217 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:08:20" (1/1) ... [2020-10-21 23:08:20,236 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:08:20" (1/1) ... [2020-10-21 23:08:20,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 23:08:20,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 23:08:20,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 23:08:20,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 23:08:20,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (1/1) ... [2020-10-21 23:08:20,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 23:08:20,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 23:08:20,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 23:08:20,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 23:08:20,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (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:08:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 23:08:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 23:08:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 23:08:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 23:08:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 23:08:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 23:08:20,400 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 23:08:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 23:08:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 23:08:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 23:08:20,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 23:08:20,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 23:08:20,405 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:08:22,431 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 23:08:22,432 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 23:08:22,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:08:22 BoogieIcfgContainer [2020-10-21 23:08:22,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 23:08:22,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 23:08:22,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 23:08:22,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 23:08:22,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 11:08:19" (1/3) ... [2020-10-21 23:08:22,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2fe030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:08:22, skipping insertion in model container [2020-10-21 23:08:22,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 11:08:20" (2/3) ... [2020-10-21 23:08:22,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2fe030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 11:08:22, skipping insertion in model container [2020-10-21 23:08:22,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 11:08:22" (3/3) ... [2020-10-21 23:08:22,444 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-21 23:08:22,457 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 23:08:22,457 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 23:08:22,465 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 23:08:22,466 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 23:08:22,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 23:08:22,520 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 23:08:22,535 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-21 23:08:22,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 23:08:22,557 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 23:08:22,558 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 23:08:22,558 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 23:08:22,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 23:08:22,558 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 23:08:22,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 23:08:22,558 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 23:08:22,573 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 23:08:22,574 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 23:08:22,577 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-21 23:08:22,579 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-21 23:08:22,623 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-21 23:08:22,623 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 23:08:22,628 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-21 23:08:22,631 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-21 23:08:22,952 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 23:08:23,081 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 23:08:23,473 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-21 23:08:25,319 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-21 23:08:25,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-21 23:08:25,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:25,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 23:08:25,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:26,396 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-10-21 23:08:27,590 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-21 23:08:27,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-21 23:08:27,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:27,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-21 23:08:27,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 23:08:28,813 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 141 DAG size of output: 104 [2020-10-21 23:08:29,554 WARN L193 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-21 23:08:29,950 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-21 23:08:30,066 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-21 23:08:30,436 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-21 23:08:30,729 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-21 23:08:31,243 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 23:08:31,566 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-21 23:08:31,894 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-21 23:08:32,053 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-21 23:08:32,059 INFO L131 LiptonReduction]: Checked pairs total: 2421 [2020-10-21 23:08:32,059 INFO L133 LiptonReduction]: Total number of compositions: 77 [2020-10-21 23:08:32,066 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-21 23:08:32,086 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-21 23:08:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-21 23:08:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 23:08:32,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:32,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 23:08:32,096 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:32,102 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-10-21 23:08:32,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:32,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002116815] [2020-10-21 23:08:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:32,344 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:08:32,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002116815] [2020-10-21 23:08:32,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:32,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:32,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184654165] [2020-10-21 23:08:32,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:32,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:32,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:32,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:32,371 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-21 23:08:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:32,447 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-21 23:08:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:32,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 23:08:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:32,463 INFO L225 Difference]: With dead ends: 137 [2020-10-21 23:08:32,463 INFO L226 Difference]: Without dead ends: 112 [2020-10-21 23:08:32,464 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:08:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-21 23:08:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-21 23:08:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-21 23:08:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-21 23:08:32,517 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-21 23:08:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:32,517 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-21 23:08:32,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-21 23:08:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-21 23:08:32,518 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:32,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:32,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:08:32,519 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-10-21 23:08:32,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:32,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456592908] [2020-10-21 23:08:32,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:32,638 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:08:32,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456592908] [2020-10-21 23:08:32,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:32,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:08:32,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049206560] [2020-10-21 23:08:32,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:32,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:32,642 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-21 23:08:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:32,685 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-21 23:08:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:32,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-21 23:08:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:32,688 INFO L225 Difference]: With dead ends: 110 [2020-10-21 23:08:32,688 INFO L226 Difference]: Without dead ends: 110 [2020-10-21 23:08:32,690 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:08:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-21 23:08:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-21 23:08:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-21 23:08:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-21 23:08:32,712 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-21 23:08:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:32,712 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-21 23:08:32,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-21 23:08:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-21 23:08:32,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:32,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:32,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:08:32,714 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:32,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-10-21 23:08:32,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:32,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628444962] [2020-10-21 23:08:32,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:32,879 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:08:32,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628444962] [2020-10-21 23:08:32,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:32,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:08:32,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638724499] [2020-10-21 23:08:32,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:08:32,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:08:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:08:32,881 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-21 23:08:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:32,934 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-21 23:08:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:32,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-21 23:08:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:32,940 INFO L225 Difference]: With dead ends: 109 [2020-10-21 23:08:32,940 INFO L226 Difference]: Without dead ends: 109 [2020-10-21 23:08:32,940 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:08:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-21 23:08:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-21 23:08:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-21 23:08:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-21 23:08:32,959 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-21 23:08:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:32,962 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-21 23:08:32,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:08:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-21 23:08:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:08:32,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:32,963 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:32,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:08:32,964 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-10-21 23:08:32,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:32,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689779779] [2020-10-21 23:08:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,173 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:08:33,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689779779] [2020-10-21 23:08:33,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:33,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618532113] [2020-10-21 23:08:33,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:33,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:33,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:33,176 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-21 23:08:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:33,279 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-10-21 23:08:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:33,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 23:08:33,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:33,282 INFO L225 Difference]: With dead ends: 106 [2020-10-21 23:08:33,282 INFO L226 Difference]: Without dead ends: 106 [2020-10-21 23:08:33,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-21 23:08:33,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-21 23:08:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-21 23:08:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-21 23:08:33,306 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 9 [2020-10-21 23:08:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:33,306 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-21 23:08:33,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-21 23:08:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:08:33,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:33,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:33,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:08:33,308 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1953630653, now seen corresponding path program 1 times [2020-10-21 23:08:33,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:33,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172884197] [2020-10-21 23:08:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 23:08:33,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172884197] [2020-10-21 23:08:33,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:08:33,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107893967] [2020-10-21 23:08:33,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:08:33,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:08:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:08:33,406 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 4 states. [2020-10-21 23:08:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:33,452 INFO L93 Difference]: Finished difference Result 107 states and 239 transitions. [2020-10-21 23:08:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:33,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-21 23:08:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:33,457 INFO L225 Difference]: With dead ends: 107 [2020-10-21 23:08:33,458 INFO L226 Difference]: Without dead ends: 107 [2020-10-21 23:08:33,458 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:08:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-21 23:08:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-21 23:08:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 23:08:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 239 transitions. [2020-10-21 23:08:33,467 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 239 transitions. Word has length 9 [2020-10-21 23:08:33,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:33,467 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 239 transitions. [2020-10-21 23:08:33,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:08:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 239 transitions. [2020-10-21 23:08:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:08:33,468 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:33,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:33,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:08:33,469 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:33,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:33,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1953565553, now seen corresponding path program 2 times [2020-10-21 23:08:33,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:33,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752810304] [2020-10-21 23:08:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,533 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:08:33,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752810304] [2020-10-21 23:08:33,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:33,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223583341] [2020-10-21 23:08:33,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:33,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:33,536 INFO L87 Difference]: Start difference. First operand 107 states and 239 transitions. Second operand 5 states. [2020-10-21 23:08:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:33,605 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-10-21 23:08:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:33,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-21 23:08:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:33,607 INFO L225 Difference]: With dead ends: 104 [2020-10-21 23:08:33,607 INFO L226 Difference]: Without dead ends: 104 [2020-10-21 23:08:33,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-21 23:08:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-10-21 23:08:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-21 23:08:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-21 23:08:33,615 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 9 [2020-10-21 23:08:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:33,615 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-21 23:08:33,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-21 23:08:33,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:08:33,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:33,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:33,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:08:33,617 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:33,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:33,617 INFO L82 PathProgramCache]: Analyzing trace with hash 433034188, now seen corresponding path program 1 times [2020-10-21 23:08:33,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:33,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678199780] [2020-10-21 23:08:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:33,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,680 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:08:33,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678199780] [2020-10-21 23:08:33,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:33,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683132499] [2020-10-21 23:08:33,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:33,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:33,683 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 5 states. [2020-10-21 23:08:33,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:33,744 INFO L93 Difference]: Finished difference Result 109 states and 239 transitions. [2020-10-21 23:08:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:33,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-21 23:08:33,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:33,747 INFO L225 Difference]: With dead ends: 109 [2020-10-21 23:08:33,747 INFO L226 Difference]: Without dead ends: 109 [2020-10-21 23:08:33,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-21 23:08:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-10-21 23:08:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-21 23:08:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 236 transitions. [2020-10-21 23:08:33,753 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 236 transitions. Word has length 10 [2020-10-21 23:08:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:33,753 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 236 transitions. [2020-10-21 23:08:33,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 236 transitions. [2020-10-21 23:08:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-21 23:08:33,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:33,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:33,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:08:33,755 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-10-21 23:08:33,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:33,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539757592] [2020-10-21 23:08:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,797 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:08:33,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539757592] [2020-10-21 23:08:33,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:08:33,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336399654] [2020-10-21 23:08:33,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:08:33,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:08:33,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:08:33,799 INFO L87 Difference]: Start difference. First operand 107 states and 236 transitions. Second operand 3 states. [2020-10-21 23:08:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:33,810 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-10-21 23:08:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:08:33,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-21 23:08:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:33,812 INFO L225 Difference]: With dead ends: 153 [2020-10-21 23:08:33,812 INFO L226 Difference]: Without dead ends: 111 [2020-10-21 23:08:33,812 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:08:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-21 23:08:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2020-10-21 23:08:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-21 23:08:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-21 23:08:33,817 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-21 23:08:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:33,818 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-21 23:08:33,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:08:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-21 23:08:33,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:08:33,819 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:33,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:33,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:08:33,820 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:33,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:33,820 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-10-21 23:08:33,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:33,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784632532] [2020-10-21 23:08:33,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:33,976 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:08:33,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784632532] [2020-10-21 23:08:33,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:33,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:08:33,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597440913] [2020-10-21 23:08:33,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:08:33,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:33,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:08:33,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:33,978 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 6 states. [2020-10-21 23:08:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:34,060 INFO L93 Difference]: Finished difference Result 119 states and 236 transitions. [2020-10-21 23:08:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 23:08:34,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-21 23:08:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:34,062 INFO L225 Difference]: With dead ends: 119 [2020-10-21 23:08:34,062 INFO L226 Difference]: Without dead ends: 69 [2020-10-21 23:08:34,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:08:34,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-21 23:08:34,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-10-21 23:08:34,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-21 23:08:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-10-21 23:08:34,066 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-10-21 23:08:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:34,066 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-10-21 23:08:34,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:08:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-10-21 23:08:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-21 23:08:34,067 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:34,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:34,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:08:34,067 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:34,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-10-21 23:08:34,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:34,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18849968] [2020-10-21 23:08:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:34,135 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:08:34,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18849968] [2020-10-21 23:08:34,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:34,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:08:34,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294313651] [2020-10-21 23:08:34,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:08:34,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:08:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:08:34,138 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-10-21 23:08:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:34,166 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2020-10-21 23:08:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:08:34,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-21 23:08:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:34,167 INFO L225 Difference]: With dead ends: 57 [2020-10-21 23:08:34,167 INFO L226 Difference]: Without dead ends: 40 [2020-10-21 23:08:34,168 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:08:34,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-21 23:08:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-10-21 23:08:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-21 23:08:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-21 23:08:34,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-10-21 23:08:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:34,171 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-21 23:08:34,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:08:34,171 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-10-21 23:08:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:08:34,172 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:34,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:34,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:08:34,173 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:34,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-10-21 23:08:34,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:34,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196946306] [2020-10-21 23:08:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:08:34,249 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:08:34,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196946306] [2020-10-21 23:08:34,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:08:34,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:08:34,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656166911] [2020-10-21 23:08:34,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:08:34,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:08:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:08:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:08:34,252 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-10-21 23:08:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:08:34,288 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-21 23:08:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:08:34,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-21 23:08:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:08:34,290 INFO L225 Difference]: With dead ends: 31 [2020-10-21 23:08:34,290 INFO L226 Difference]: Without dead ends: 20 [2020-10-21 23:08:34,290 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:08:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-21 23:08:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-21 23:08:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-21 23:08:34,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-21 23:08:34,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-21 23:08:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:08:34,292 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-21 23:08:34,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:08:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-21 23:08:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:08:34,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:08:34,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:08:34,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:08:34,293 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:08:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:08:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-10-21 23:08:34,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:08:34,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831204073] [2020-10-21 23:08:34,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:08:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:34,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:08:34,375 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:08:34,409 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:08:34,409 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:08:34,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:08:34,410 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-21 23:08:34,421 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In11750927 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In11750927 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In11750927 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In11750927 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out11750927 ~x$r_buff1_thd0~0_In11750927) (or (and .cse0 (= ~x$w_buff1_used~0_In11750927 ~x$w_buff1_used~0_Out11750927)) (and (= ~x$w_buff1_used~0_Out11750927 0) .cse1 .cse2)) (= ~x$r_buff0_thd0~0_Out11750927 ~x$r_buff0_thd0~0_In11750927) (or (and (= ~x$w_buff0_used~0_Out11750927 ~x$w_buff0_used~0_In11750927) .cse3) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out11750927 0))) (or (and (or (and (= ~x~0_Out11750927 ~x$w_buff1~0_In11750927) .cse1 .cse2) (and (= ~x~0_In11750927 ~x~0_Out11750927) .cse0)) .cse3) (and .cse4 .cse5 (= ~x~0_Out11750927 ~x$w_buff0~0_In11750927))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In11750927 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In11750927, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In11750927, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In11750927, ~x$w_buff1~0=~x$w_buff1~0_In11750927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In11750927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In11750927, ~x~0=~x~0_In11750927, ~x$w_buff0_used~0=~x$w_buff0_used~0_In11750927} OutVars{~x$w_buff0~0=~x$w_buff0~0_In11750927, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out11750927, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out11750927|, ~x$w_buff1~0=~x$w_buff1~0_In11750927, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out11750927|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out11750927, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out11750927, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out11750927|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out11750927|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out11750927|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out11750927, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out11750927|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In11750927, ~x~0=~x~0_Out11750927} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-21 23:08:34,426 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:08:34,427 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-21 23:08:34,428 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:08:34,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,429 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:08:34,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,429 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:08:34,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,430 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:08:34,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,430 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:08:34,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,430 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:08:34,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,434 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:08:34,434 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,434 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:08:34,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,435 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:08:34,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,435 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:08:34,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,435 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:08:34,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,436 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:08:34,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,437 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:08:34,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,438 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:08:34,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,438 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:08:34,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,438 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:08:34,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,439 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:08:34,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,439 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:08:34,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,439 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:08:34,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,440 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:08:34,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,441 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:08:34,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:08:34,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:08:34 BasicIcfg [2020-10-21 23:08:34,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:08:34,521 INFO L168 Benchmark]: Toolchain (without parser) took 15021.54 ms. Allocated memory was 140.0 MB in the beginning and 375.4 MB in the end (delta: 235.4 MB). Free memory was 100.8 MB in the beginning and 129.6 MB in the end (delta: -28.7 MB). Peak memory consumption was 206.7 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,522 INFO L168 Benchmark]: CDTParser took 0.22 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.80 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 154.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 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:08:34,524 INFO L168 Benchmark]: Boogie Preprocessor took 42.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,525 INFO L168 Benchmark]: RCFGBuilder took 2111.71 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 148.6 MB in the beginning and 192.5 MB in the end (delta: -43.9 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,526 INFO L168 Benchmark]: TraceAbstraction took 12082.95 ms. Allocated memory was 249.0 MB in the beginning and 375.4 MB in the end (delta: 126.4 MB). Free memory was 192.5 MB in the beginning and 129.6 MB in the end (delta: 62.9 MB). Peak memory consumption was 189.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:08:34,530 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.22 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: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 701.80 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 154.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.61 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.98 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2111.71 ms. Allocated memory was 202.9 MB in the beginning and 249.0 MB in the end (delta: 46.1 MB). Free memory was 148.6 MB in the beginning and 192.5 MB in the end (delta: -43.9 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12082.95 ms. Allocated memory was 249.0 MB in the beginning and 375.4 MB in the end (delta: 126.4 MB). Free memory was 192.5 MB in the beginning and 129.6 MB in the end (delta: 62.9 MB). Peak memory consumption was 189.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 566 VarBasedMoverChecksPositive, 27 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.4s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 77 TotalNumberOfCompositions, 2421 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 163 SDtfs, 115 SDslu, 150 SDs, 0 SdLazy, 156 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 5734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...