/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:17:27,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:17:27,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:17:27,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:17:27,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:17:27,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:17:27,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:17:27,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:17:27,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:17:27,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:17:27,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:17:27,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:17:27,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:17:27,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:17:27,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:17:27,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:17:27,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:17:27,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:17:27,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:17:27,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:17:27,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:17:27,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:17:27,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:17:27,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:17:27,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:17:27,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:17:27,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:17:27,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:17:27,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:17:27,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:17:27,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:17:27,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:17:27,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:17:27,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:17:27,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:17:27,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:17:27,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:17:27,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:17:27,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:17:27,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:17:27,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:17:27,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2021-03-11 11:17:27,347 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:17:27,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:17:27,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:17:27,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:17:27,351 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:17:27,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:17:27,351 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:17:27,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:17:27,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:17:27,352 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:17:27,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:17:27,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:17:27,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:17:27,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:17:27,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:17:27,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:17:27,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 11:17:27,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:17:27,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:17:27,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:17:27,691 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:17:27,691 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:17:27,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-11 11:17:27,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eade2ffbb/c30822bd0b1048a6b6d4f6cf53288b01/FLAG254d959f9 [2021-03-11 11:17:28,202 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:17:28,203 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-11 11:17:28,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eade2ffbb/c30822bd0b1048a6b6d4f6cf53288b01/FLAG254d959f9 [2021-03-11 11:17:28,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eade2ffbb/c30822bd0b1048a6b6d4f6cf53288b01 [2021-03-11 11:17:28,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:17:28,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:17:28,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:17:28,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:17:28,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:17:28,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:17:28" (1/1) ... [2021-03-11 11:17:28,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6f939b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:28, skipping insertion in model container [2021-03-11 11:17:28,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:17:28" (1/1) ... [2021-03-11 11:17:28,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:17:28,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:17:28,714 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i[950,963] [2021-03-11 11:17:28,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:17:28,984 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:17:28,995 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i[950,963] [2021-03-11 11:17:29,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:17:29,127 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:17:29,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29 WrapperNode [2021-03-11 11:17:29,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:17:29,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:17:29,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:17:29,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:17:29,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:17:29,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:17:29,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:17:29,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:17:29,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (1/1) ... [2021-03-11 11:17:29,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:17:29,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:17:29,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:17:29,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:17:29,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (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 [2021-03-11 11:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:17:29,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:17:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:17:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:17:29,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:17:29,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:17:29,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:17:29,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:17:29,318 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:17:30,928 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:17:30,929 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:17:30,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:17:30 BoogieIcfgContainer [2021-03-11 11:17:30,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:17:30,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:17:30,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:17:30,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:17:30,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:17:28" (1/3) ... [2021-03-11 11:17:30,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d39d1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:17:30, skipping insertion in model container [2021-03-11 11:17:30,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:17:29" (2/3) ... [2021-03-11 11:17:30,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d39d1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:17:30, skipping insertion in model container [2021-03-11 11:17:30,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:17:30" (3/3) ... [2021-03-11 11:17:30,937 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-03-11 11:17:30,943 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:17:30,943 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:17:30,947 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:17:30,947 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,999 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,999 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,999 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:30,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,002 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:17:31,006 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:17:31,020 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:17:31,035 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:17:31,035 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:17:31,035 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:17:31,035 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:17:31,035 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:17:31,035 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:17:31,035 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:17:31,036 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:17:31,045 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:17:31,053 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:17:31,055 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:17:31,056 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 11:17:31,085 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 11:17:31,086 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:17:31,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 11:17:31,090 INFO L116 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-11 11:17:32,099 WARN L205 SmtUtils]: Spent 848.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 11:17:32,439 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 11:17:33,934 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 11:17:34,556 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 11:17:35,581 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:17:35,939 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 11:17:36,049 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 11:17:36,923 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:17:37,049 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:17:38,340 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-11 11:17:38,907 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-03-11 11:17:39,031 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:17:39,377 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-03-11 11:17:39,539 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:17:39,542 INFO L131 LiptonReduction]: Checked pairs total: 4872 [2021-03-11 11:17:39,542 INFO L133 LiptonReduction]: Total number of compositions: 80 [2021-03-11 11:17:39,548 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-03-11 11:17:39,609 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 972 states, 968 states have (on average 3.37603305785124) internal successors, (3268), 971 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 972 states, 968 states have (on average 3.37603305785124) internal successors, (3268), 971 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 11:17:39,617 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:39,618 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 11:17:39,618 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1015834433, now seen corresponding path program 1 times [2021-03-11 11:17:39,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:39,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685502939] [2021-03-11 11:17:39,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:39,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:39,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:39,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685502939] [2021-03-11 11:17:39,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:39,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:17:39,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114566672] [2021-03-11 11:17:39,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:17:39,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:39,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:17:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:17:39,862 INFO L87 Difference]: Start difference. First operand has 972 states, 968 states have (on average 3.37603305785124) internal successors, (3268), 971 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:39,929 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2021-03-11 11:17:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:17:39,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-03-11 11:17:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:39,947 INFO L225 Difference]: With dead ends: 812 [2021-03-11 11:17:39,947 INFO L226 Difference]: Without dead ends: 687 [2021-03-11 11:17:39,948 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:17:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-03-11 11:17:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-03-11 11:17:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2021-03-11 11:17:40,049 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 5 [2021-03-11 11:17:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,049 INFO L480 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2021-03-11 11:17:40,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2021-03-11 11:17:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:17:40,051 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,051 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:17:40,052 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1539237607, now seen corresponding path program 1 times [2021-03-11 11:17:40,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438099831] [2021-03-11 11:17:40,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:40,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:40,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438099831] [2021-03-11 11:17:40,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:40,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:17:40,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555472524] [2021-03-11 11:17:40,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:17:40,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:40,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:17:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:17:40,261 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:40,315 INFO L93 Difference]: Finished difference Result 772 states and 2318 transitions. [2021-03-11 11:17:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:40,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-03-11 11:17:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:40,320 INFO L225 Difference]: With dead ends: 772 [2021-03-11 11:17:40,320 INFO L226 Difference]: Without dead ends: 647 [2021-03-11 11:17:40,320 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-03-11 11:17:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2021-03-11 11:17:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 3.0928792569659445) internal successors, (1998), 646 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1998 transitions. [2021-03-11 11:17:40,341 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1998 transitions. Word has length 10 [2021-03-11 11:17:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,345 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 1998 transitions. [2021-03-11 11:17:40,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1998 transitions. [2021-03-11 11:17:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:17:40,353 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,353 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:17:40,353 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,354 INFO L82 PathProgramCache]: Analyzing trace with hash -505790080, now seen corresponding path program 1 times [2021-03-11 11:17:40,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034496841] [2021-03-11 11:17:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:40,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:17:40,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:40,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034496841] [2021-03-11 11:17:40,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:40,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:17:40,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875896347] [2021-03-11 11:17:40,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:17:40,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:17:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:17:40,457 INFO L87 Difference]: Start difference. First operand 647 states and 1998 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:40,506 INFO L93 Difference]: Finished difference Result 932 states and 2746 transitions. [2021-03-11 11:17:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-03-11 11:17:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:40,511 INFO L225 Difference]: With dead ends: 932 [2021-03-11 11:17:40,511 INFO L226 Difference]: Without dead ends: 677 [2021-03-11 11:17:40,511 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-03-11 11:17:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 587. [2021-03-11 11:17:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 2.977815699658703) internal successors, (1745), 586 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1745 transitions. [2021-03-11 11:17:40,529 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1745 transitions. Word has length 12 [2021-03-11 11:17:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 1745 transitions. [2021-03-11 11:17:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1745 transitions. [2021-03-11 11:17:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:17:40,531 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,531 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:17:40,531 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1739497691, now seen corresponding path program 1 times [2021-03-11 11:17:40,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116708409] [2021-03-11 11:17:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:40,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:40,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116708409] [2021-03-11 11:17:40,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:40,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:17:40,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037953422] [2021-03-11 11:17:40,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:17:40,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:17:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:17:40,620 INFO L87 Difference]: Start difference. First operand 587 states and 1745 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:40,651 INFO L93 Difference]: Finished difference Result 632 states and 1826 transitions. [2021-03-11 11:17:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:40,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-03-11 11:17:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:40,654 INFO L225 Difference]: With dead ends: 632 [2021-03-11 11:17:40,654 INFO L226 Difference]: Without dead ends: 557 [2021-03-11 11:17:40,655 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2021-03-11 11:17:40,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2021-03-11 11:17:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.9514388489208634) internal successors, (1641), 556 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1641 transitions. [2021-03-11 11:17:40,671 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1641 transitions. Word has length 12 [2021-03-11 11:17:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,671 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 1641 transitions. [2021-03-11 11:17:40,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1641 transitions. [2021-03-11 11:17:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:17:40,672 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,672 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,672 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:17:40,675 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,676 INFO L82 PathProgramCache]: Analyzing trace with hash 320185557, now seen corresponding path program 1 times [2021-03-11 11:17:40,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969509745] [2021-03-11 11:17:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:40,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:40,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969509745] [2021-03-11 11:17:40,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:40,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:17:40,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859874740] [2021-03-11 11:17:40,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:17:40,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:40,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:17:40,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:40,788 INFO L87 Difference]: Start difference. First operand 557 states and 1641 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:40,835 INFO L93 Difference]: Finished difference Result 749 states and 2189 transitions. [2021-03-11 11:17:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:40,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:17:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:40,838 INFO L225 Difference]: With dead ends: 749 [2021-03-11 11:17:40,838 INFO L226 Difference]: Without dead ends: 389 [2021-03-11 11:17:40,838 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:17:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-03-11 11:17:40,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2021-03-11 11:17:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.850515463917526) internal successors, (1106), 388 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1106 transitions. [2021-03-11 11:17:40,847 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 1106 transitions. Word has length 13 [2021-03-11 11:17:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,847 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 1106 transitions. [2021-03-11 11:17:40,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 1106 transitions. [2021-03-11 11:17:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:17:40,848 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,849 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:17:40,849 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,849 INFO L82 PathProgramCache]: Analyzing trace with hash 575980084, now seen corresponding path program 1 times [2021-03-11 11:17:40,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233347822] [2021-03-11 11:17:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:40,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:40,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:40,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233347822] [2021-03-11 11:17:40,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:40,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:17:40,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819670744] [2021-03-11 11:17:40,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:17:40,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:40,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:17:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:40,907 INFO L87 Difference]: Start difference. First operand 389 states and 1106 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:40,943 INFO L93 Difference]: Finished difference Result 629 states and 1794 transitions. [2021-03-11 11:17:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:40,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 11:17:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:40,946 INFO L225 Difference]: With dead ends: 629 [2021-03-11 11:17:40,946 INFO L226 Difference]: Without dead ends: 341 [2021-03-11 11:17:40,946 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:17:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-03-11 11:17:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-03-11 11:17:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 2.876470588235294) internal successors, (978), 340 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 978 transitions. [2021-03-11 11:17:40,954 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 978 transitions. Word has length 15 [2021-03-11 11:17:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:40,954 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 978 transitions. [2021-03-11 11:17:40,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 978 transitions. [2021-03-11 11:17:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:17:40,955 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:40,955 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:40,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:17:40,955 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1236971834, now seen corresponding path program 2 times [2021-03-11 11:17:40,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:40,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026845060] [2021-03-11 11:17:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:17:41,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026845060] [2021-03-11 11:17:41,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:17:41,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066289545] [2021-03-11 11:17:41,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:17:41,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:17:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:41,035 INFO L87 Difference]: Start difference. First operand 341 states and 978 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:41,076 INFO L93 Difference]: Finished difference Result 485 states and 1386 transitions. [2021-03-11 11:17:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:17:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 11:17:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:41,079 INFO L225 Difference]: With dead ends: 485 [2021-03-11 11:17:41,079 INFO L226 Difference]: Without dead ends: 245 [2021-03-11 11:17:41,080 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 26.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:17:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-03-11 11:17:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-03-11 11:17:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.762295081967213) internal successors, (674), 244 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 674 transitions. [2021-03-11 11:17:41,085 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 674 transitions. Word has length 15 [2021-03-11 11:17:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:41,086 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 674 transitions. [2021-03-11 11:17:41,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 674 transitions. [2021-03-11 11:17:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:17:41,086 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:41,086 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:41,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:17:41,087 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:41,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1218866594, now seen corresponding path program 3 times [2021-03-11 11:17:41,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:41,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589778486] [2021-03-11 11:17:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:17:41,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:17:41,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:17:41,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589778486] [2021-03-11 11:17:41,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:17:41,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089134082] [2021-03-11 11:17:41,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:17:41,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:17:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:41,218 INFO L87 Difference]: Start difference. First operand 245 states and 674 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:41,299 INFO L93 Difference]: Finished difference Result 279 states and 742 transitions. [2021-03-11 11:17:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:17:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 11:17:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:41,301 INFO L225 Difference]: With dead ends: 279 [2021-03-11 11:17:41,301 INFO L226 Difference]: Without dead ends: 243 [2021-03-11 11:17:41,301 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:17:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-03-11 11:17:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-03-11 11:17:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.7520661157024793) internal successors, (666), 242 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 666 transitions. [2021-03-11 11:17:41,307 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 666 transitions. Word has length 15 [2021-03-11 11:17:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:41,307 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 666 transitions. [2021-03-11 11:17:41,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 666 transitions. [2021-03-11 11:17:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:17:41,308 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:41,308 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:41,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:17:41,308 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:41,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:41,309 INFO L82 PathProgramCache]: Analyzing trace with hash -521657079, now seen corresponding path program 1 times [2021-03-11 11:17:41,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:41,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796036651] [2021-03-11 11:17:41,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,353 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:17:41,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:17:41,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:17:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796036651] [2021-03-11 11:17:41,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:17:41,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387570542] [2021-03-11 11:17:41,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:17:41,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:17:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:17:41,363 INFO L87 Difference]: Start difference. First operand 243 states and 666 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:41,386 INFO L93 Difference]: Finished difference Result 230 states and 548 transitions. [2021-03-11 11:17:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:17:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-03-11 11:17:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:41,387 INFO L225 Difference]: With dead ends: 230 [2021-03-11 11:17:41,387 INFO L226 Difference]: Without dead ends: 177 [2021-03-11 11:17:41,388 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-03-11 11:17:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-03-11 11:17:41,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.375) internal successors, (418), 176 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 418 transitions. [2021-03-11 11:17:41,392 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 418 transitions. Word has length 16 [2021-03-11 11:17:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:41,392 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 418 transitions. [2021-03-11 11:17:41,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 418 transitions. [2021-03-11 11:17:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:17:41,393 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:41,393 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:41,393 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:17:41,393 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 225816641, now seen corresponding path program 1 times [2021-03-11 11:17:41,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:41,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166729769] [2021-03-11 11:17:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,446 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:17:41,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:17:41,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:17:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166729769] [2021-03-11 11:17:41,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:17:41,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416670447] [2021-03-11 11:17:41,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:17:41,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:17:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:17:41,458 INFO L87 Difference]: Start difference. First operand 177 states and 418 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:41,520 INFO L93 Difference]: Finished difference Result 132 states and 266 transitions. [2021-03-11 11:17:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:17:41,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-11 11:17:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:41,521 INFO L225 Difference]: With dead ends: 132 [2021-03-11 11:17:41,521 INFO L226 Difference]: Without dead ends: 101 [2021-03-11 11:17:41,522 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:17:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-03-11 11:17:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-03-11 11:17:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.94) internal successors, (194), 100 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 194 transitions. [2021-03-11 11:17:41,524 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 194 transitions. Word has length 17 [2021-03-11 11:17:41,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:41,524 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 194 transitions. [2021-03-11 11:17:41,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 194 transitions. [2021-03-11 11:17:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:17:41,525 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:41,525 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:41,525 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:17:41,525 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:41,526 INFO L82 PathProgramCache]: Analyzing trace with hash 172684256, now seen corresponding path program 1 times [2021-03-11 11:17:41,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:41,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418733868] [2021-03-11 11:17:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:17:41,604 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-11 11:17:41,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:17:41,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:17:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418733868] [2021-03-11 11:17:41,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:17:41,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803663460] [2021-03-11 11:17:41,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:17:41,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:17:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:17:41,618 INFO L87 Difference]: Start difference. First operand 101 states and 194 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:41,655 INFO L93 Difference]: Finished difference Result 80 states and 150 transitions. [2021-03-11 11:17:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:17:41,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-03-11 11:17:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:41,656 INFO L225 Difference]: With dead ends: 80 [2021-03-11 11:17:41,656 INFO L226 Difference]: Without dead ends: 71 [2021-03-11 11:17:41,657 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:17:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-03-11 11:17:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-03-11 11:17:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2021-03-11 11:17:41,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 19 [2021-03-11 11:17:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:41,659 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2021-03-11 11:17:41,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2021-03-11 11:17:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:17:41,659 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:41,660 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:41,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:17:41,660 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -671656755, now seen corresponding path program 1 times [2021-03-11 11:17:41,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:41,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587733411] [2021-03-11 11:17:41,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:41,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:17:41,785 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-11 11:17:41,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-11 11:17:41,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:17:41,830 INFO L142 QuantifierPusher]: treesize reduction 13, result has 66.7 percent of original size [2021-03-11 11:17:41,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-11 11:17:41,860 INFO L142 QuantifierPusher]: treesize reduction 13, result has 69.0 percent of original size [2021-03-11 11:17:41,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-11 11:17:41,894 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-11 11:17:41,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-11 11:17:41,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:17:41,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:41,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:41,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587733411] [2021-03-11 11:17:41,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:41,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:17:41,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671772890] [2021-03-11 11:17:41,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:17:41,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:17:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:17:41,947 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:42,158 INFO L93 Difference]: Finished difference Result 98 states and 183 transitions. [2021-03-11 11:17:42,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:17:42,158 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-03-11 11:17:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:42,159 INFO L225 Difference]: With dead ends: 98 [2021-03-11 11:17:42,159 INFO L226 Difference]: Without dead ends: 75 [2021-03-11 11:17:42,159 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 223.3ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:17:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-03-11 11:17:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2021-03-11 11:17:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 62 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2021-03-11 11:17:42,162 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2021-03-11 11:17:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:42,162 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2021-03-11 11:17:42,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2021-03-11 11:17:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:17:42,162 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:42,162 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:42,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:17:42,163 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:42,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1378967873, now seen corresponding path program 2 times [2021-03-11 11:17:42,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:42,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593231465] [2021-03-11 11:17:42,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:17:42,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:42,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:17:42,274 INFO L142 QuantifierPusher]: treesize reduction 14, result has 83.9 percent of original size [2021-03-11 11:17:42,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-03-11 11:17:42,314 INFO L142 QuantifierPusher]: treesize reduction 22, result has 81.8 percent of original size [2021-03-11 11:17:42,319 INFO L147 QuantifierPusher]: treesize reduction 9, result has 90.9 percent of original size 90 [2021-03-11 11:17:42,365 INFO L142 QuantifierPusher]: treesize reduction 22, result has 82.4 percent of original size [2021-03-11 11:17:42,367 INFO L147 QuantifierPusher]: treesize reduction 9, result has 91.3 percent of original size 94 [2021-03-11 11:17:42,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:42,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:17:42,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:42,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:17:42,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:42,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:17:42,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:17:42,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 11:17:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:17:42,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593231465] [2021-03-11 11:17:42,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:17:42,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:17:42,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722719565] [2021-03-11 11:17:42,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:17:42,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:17:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:17:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:17:42,485 INFO L87 Difference]: Start difference. First operand 63 states and 110 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:17:42,658 INFO L93 Difference]: Finished difference Result 100 states and 170 transitions. [2021-03-11 11:17:42,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:17:42,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-03-11 11:17:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:17:42,660 INFO L225 Difference]: With dead ends: 100 [2021-03-11 11:17:42,660 INFO L226 Difference]: Without dead ends: 67 [2021-03-11 11:17:42,660 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 243.0ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:17:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-03-11 11:17:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2021-03-11 11:17:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.72) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2021-03-11 11:17:42,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2021-03-11 11:17:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:17:42,662 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2021-03-11 11:17:42,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:17:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2021-03-11 11:17:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:17:42,663 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:17:42,663 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:17:42,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:17:42,663 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:17:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:17:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash -896484915, now seen corresponding path program 3 times [2021-03-11 11:17:42,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:17:42,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699145037] [2021-03-11 11:17:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:17:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:17:42,702 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:17:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:17:42,767 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:17:42,816 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:17:42,816 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:17:42,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:17:42,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:17:42 BasicIcfg [2021-03-11 11:17:42,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:17:42,901 INFO L168 Benchmark]: Toolchain (without parser) took 14377.74 ms. Allocated memory was 255.9 MB in the beginning and 583.0 MB in the end (delta: 327.2 MB). Free memory was 233.3 MB in the beginning and 312.9 MB in the end (delta: -79.7 MB). Peak memory consumption was 246.0 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,901 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:17:42,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.86 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 232.7 MB in the beginning and 340.5 MB in the end (delta: -107.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,902 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 379.6 MB. Free memory was 340.1 MB in the beginning and 337.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,902 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 379.6 MB. Free memory was 337.3 MB in the beginning and 335.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,902 INFO L168 Benchmark]: RCFGBuilder took 1693.80 ms. Allocated memory is still 379.6 MB. Free memory was 335.2 MB in the beginning and 335.0 MB in the end (delta: 176.4 kB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,902 INFO L168 Benchmark]: TraceAbstraction took 11968.04 ms. Allocated memory was 379.6 MB in the beginning and 583.0 MB in the end (delta: 203.4 MB). Free memory was 335.0 MB in the beginning and 312.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 224.4 MB. Max. memory is 16.0 GB. [2021-03-11 11:17:42,904 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 593.86 ms. Allocated memory was 255.9 MB in the beginning and 379.6 MB in the end (delta: 123.7 MB). Free memory was 232.7 MB in the beginning and 340.5 MB in the end (delta: -107.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 67.56 ms. Allocated memory is still 379.6 MB. Free memory was 340.1 MB in the beginning and 337.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 379.6 MB. Free memory was 337.3 MB in the beginning and 335.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1693.80 ms. Allocated memory is still 379.6 MB. Free memory was 335.2 MB in the beginning and 335.0 MB in the end (delta: 176.4 kB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11968.04 ms. Allocated memory was 379.6 MB in the beginning and 583.0 MB in the end (delta: 203.4 MB). Free memory was 335.0 MB in the beginning and 312.9 MB in the end (delta: 22.1 MB). Peak memory consumption was 224.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8487.3ms, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 4872 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2260, positive: 2085, positive conditional: 0, positive unconditional: 2085, negative: 175, negative conditional: 0, negative unconditional: 175, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1211, positive: 1170, positive conditional: 0, positive unconditional: 1170, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1211, positive: 1144, positive conditional: 0, positive unconditional: 1144, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 661, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 600, negative conditional: 0, negative unconditional: 600, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2260, positive: 915, positive conditional: 0, positive unconditional: 915, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 1211, unknown conditional: 0, unknown unconditional: 1211] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1807; [L819] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t1808; [L821] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1809; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L823] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L747] 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) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] 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 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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) [L843] 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)) [L843] 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)) [L844] 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)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] 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)) [L845] 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)) [L846] 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)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11783.9ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 23.2ms, AutomataDifference: 996.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8573.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 366 SDtfs, 419 SDslu, 773 SDs, 0 SdLazy, 354 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 448.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 699.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 179.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.4ms SsaConstructionTime, 520.1ms SatisfiabilityAnalysisTime, 1104.8ms InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...