/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:47:50,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:47:50,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:47:50,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:47:50,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:47:50,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:47:50,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:47:50,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:47:50,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:47:50,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:47:50,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:47:50,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:47:50,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:47:50,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:47:50,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:47:50,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:47:50,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:47:50,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:47:50,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:47:50,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:47:50,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:47:50,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:47:50,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:47:50,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:47:50,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:47:50,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:47:50,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:47:50,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:47:50,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:47:50,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:47:50,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:47:50,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:47:50,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:47:50,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:47:50,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:47:50,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:47:50,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:47:50,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:47:50,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:47:50,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:47:50,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:47:50,386 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-NoLbe.epf [2021-07-09 16:47:50,454 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:47:50,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:47:50,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:47:50,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:47:50,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:47:50,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:47:50,456 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:47:50,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:47:50,456 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:47:50,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:47:50,458 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:47:50,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:47:50,458 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:47:50,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:47:50,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:47:50,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:47:50,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:47:50,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:47:50,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:47:50,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:47:50,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:47:50,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:47:50,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:47:50,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:47:50,460 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:47:50,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:47:50,460 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-07-09 16:47:50,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:47:50,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:47:50,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:47:50,813 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:47:50,815 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:47:50,816 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-07-09 16:47:50,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3faadb70d/1042908598444d7da9a290a044f4d9bd/FLAGb07a926bb [2021-07-09 16:47:51,312 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:47:51,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-07-09 16:47:51,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3faadb70d/1042908598444d7da9a290a044f4d9bd/FLAGb07a926bb [2021-07-09 16:47:51,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3faadb70d/1042908598444d7da9a290a044f4d9bd [2021-07-09 16:47:51,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:47:51,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:47:51,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:47:51,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:47:51,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:47:51,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:47:51" (1/1) ... [2021-07-09 16:47:51,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdcc1c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:51, skipping insertion in model container [2021-07-09 16:47:51,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:47:51" (1/1) ... [2021-07-09 16:47:51,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:47:51,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:47:51,884 WARN L224 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-07-09 16:47:52,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:47:52,133 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:47:52,145 WARN L224 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-07-09 16:47:52,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:47:52,253 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:47:52,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52 WrapperNode [2021-07-09 16:47:52,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:47:52,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:47:52,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:47:52,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:47:52,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:47:52,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:47:52,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:47:52,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:47:52,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (1/1) ... [2021-07-09 16:47:52,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:47:52,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:47:52,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:47:52,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:47:52,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (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-07-09 16:47:52,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:47:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:47:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:47:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:47:52,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:47:52,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:47:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:47:52,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:47:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:47:52,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:47:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:47:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:47:52,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:47:52,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:47:52,423 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:47:54,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:47:54,373 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:47:54,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:47:54 BoogieIcfgContainer [2021-07-09 16:47:54,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:47:54,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:47:54,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:47:54,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:47:54,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:47:51" (1/3) ... [2021-07-09 16:47:54,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aabe27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:47:54, skipping insertion in model container [2021-07-09 16:47:54,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:47:52" (2/3) ... [2021-07-09 16:47:54,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aabe27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:47:54, skipping insertion in model container [2021-07-09 16:47:54,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:47:54" (3/3) ... [2021-07-09 16:47:54,380 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-07-09 16:47:54,392 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:47:54,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:47:54,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:47:54,392 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:47:54,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,420 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,424 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,428 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,434 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,438 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:47:54,440 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:47:54,458 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:47:54,473 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:47:54,473 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:47:54,473 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:47:54,473 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:47:54,473 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:47:54,473 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:47:54,473 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:47:54,473 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:47:54,481 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-09 16:47:54,766 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9815 states, 9813 states have (on average 3.5741363497401406) internal successors, (35073), 9814 states have internal predecessors, (35073), 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-07-09 16:47:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 9815 states, 9813 states have (on average 3.5741363497401406) internal successors, (35073), 9814 states have internal predecessors, (35073), 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-07-09 16:47:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 16:47:54,853 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:54,853 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:54,854 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:54,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1192679358, now seen corresponding path program 1 times [2021-07-09 16:47:54,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:54,868 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270285839] [2021-07-09 16:47:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:55,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:55,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270285839] [2021-07-09 16:47:55,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270285839] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:55,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:55,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:47:55,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797470618] [2021-07-09 16:47:55,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:47:55,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:55,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:47:55,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:47:55,343 INFO L87 Difference]: Start difference. First operand has 9815 states, 9813 states have (on average 3.5741363497401406) internal successors, (35073), 9814 states have internal predecessors, (35073), 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 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-09 16:47:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:55,778 INFO L93 Difference]: Finished difference Result 11255 states and 39197 transitions. [2021-07-09 16:47:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:47:55,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2021-07-09 16:47:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:55,901 INFO L225 Difference]: With dead ends: 11255 [2021-07-09 16:47:55,901 INFO L226 Difference]: Without dead ends: 8375 [2021-07-09 16:47:55,903 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 137.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8375 states. [2021-07-09 16:47:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8375 to 8375. [2021-07-09 16:47:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8375 states, 8373 states have (on average 3.481308969306103) internal successors, (29149), 8374 states have internal predecessors, (29149), 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-07-09 16:47:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8375 states to 8375 states and 29149 transitions. [2021-07-09 16:47:56,331 INFO L78 Accepts]: Start accepts. Automaton has 8375 states and 29149 transitions. Word has length 67 [2021-07-09 16:47:56,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:56,333 INFO L482 AbstractCegarLoop]: Abstraction has 8375 states and 29149 transitions. [2021-07-09 16:47:56,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-07-09 16:47:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8375 states and 29149 transitions. [2021-07-09 16:47:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-07-09 16:47:56,349 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:56,349 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:56,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:47:56,350 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash 425259459, now seen corresponding path program 1 times [2021-07-09 16:47:56,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:56,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524298934] [2021-07-09 16:47:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:56,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:56,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:56,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524298934] [2021-07-09 16:47:56,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524298934] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:56,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:56,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:47:56,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464231915] [2021-07-09 16:47:56,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:47:56,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:47:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:47:56,587 INFO L87 Difference]: Start difference. First operand 8375 states and 29149 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-07-09 16:47:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:56,837 INFO L93 Difference]: Finished difference Result 9455 states and 32629 transitions. [2021-07-09 16:47:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:47:56,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2021-07-09 16:47:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:56,902 INFO L225 Difference]: With dead ends: 9455 [2021-07-09 16:47:56,903 INFO L226 Difference]: Without dead ends: 7727 [2021-07-09 16:47:56,904 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 96.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:56,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7727 states. [2021-07-09 16:47:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7727 to 7727. [2021-07-09 16:47:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7727 states, 7725 states have (on average 3.4611003236245956) internal successors, (26737), 7726 states have internal predecessors, (26737), 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-07-09 16:47:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7727 states to 7727 states and 26737 transitions. [2021-07-09 16:47:57,216 INFO L78 Accepts]: Start accepts. Automaton has 7727 states and 26737 transitions. Word has length 69 [2021-07-09 16:47:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:57,218 INFO L482 AbstractCegarLoop]: Abstraction has 7727 states and 26737 transitions. [2021-07-09 16:47:57,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-07-09 16:47:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7727 states and 26737 transitions. [2021-07-09 16:47:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:47:57,236 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:57,236 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:57,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:47:57,236 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:57,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1421911772, now seen corresponding path program 1 times [2021-07-09 16:47:57,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:57,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623872035] [2021-07-09 16:47:57,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:57,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:57,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623872035] [2021-07-09 16:47:57,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623872035] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:57,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:57,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:47:57,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979895292] [2021-07-09 16:47:57,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:47:57,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:57,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:47:57,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:47:57,430 INFO L87 Difference]: Start difference. First operand 7727 states and 26737 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-07-09 16:47:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:57,742 INFO L93 Difference]: Finished difference Result 8879 states and 30493 transitions. [2021-07-09 16:47:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:47:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2021-07-09 16:47:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:57,777 INFO L225 Difference]: With dead ends: 8879 [2021-07-09 16:47:57,778 INFO L226 Difference]: Without dead ends: 7583 [2021-07-09 16:47:57,778 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 119.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2021-07-09 16:47:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 7583. [2021-07-09 16:47:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7583 states, 7581 states have (on average 3.4540298113705314) internal successors, (26185), 7582 states have internal predecessors, (26185), 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-07-09 16:47:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7583 states to 7583 states and 26185 transitions. [2021-07-09 16:47:58,078 INFO L78 Accepts]: Start accepts. Automaton has 7583 states and 26185 transitions. Word has length 71 [2021-07-09 16:47:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:58,079 INFO L482 AbstractCegarLoop]: Abstraction has 7583 states and 26185 transitions. [2021-07-09 16:47:58,079 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-07-09 16:47:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7583 states and 26185 transitions. [2021-07-09 16:47:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-07-09 16:47:58,096 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:58,096 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:58,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:47:58,097 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash -105471251, now seen corresponding path program 1 times [2021-07-09 16:47:58,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:58,098 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214808986] [2021-07-09 16:47:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:58,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:58,209 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214808986] [2021-07-09 16:47:58,209 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214808986] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:58,209 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:58,209 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:47:58,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278627377] [2021-07-09 16:47:58,209 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:47:58,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:47:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:47:58,210 INFO L87 Difference]: Start difference. First operand 7583 states and 26185 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-07-09 16:47:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:58,387 INFO L93 Difference]: Finished difference Result 10223 states and 35147 transitions. [2021-07-09 16:47:58,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:47:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2021-07-09 16:47:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:58,416 INFO L225 Difference]: With dead ends: 10223 [2021-07-09 16:47:58,417 INFO L226 Difference]: Without dead ends: 4935 [2021-07-09 16:47:58,421 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 89.4ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4935 states. [2021-07-09 16:47:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4935 to 4935. [2021-07-09 16:47:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4935 states, 4934 states have (on average 3.3307661126874746) internal successors, (16434), 4934 states have internal predecessors, (16434), 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-07-09 16:47:58,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 16434 transitions. [2021-07-09 16:47:58,697 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 16434 transitions. Word has length 72 [2021-07-09 16:47:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:58,697 INFO L482 AbstractCegarLoop]: Abstraction has 4935 states and 16434 transitions. [2021-07-09 16:47:58,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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-07-09 16:47:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 16434 transitions. [2021-07-09 16:47:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-07-09 16:47:58,709 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:58,709 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:58,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:47:58,710 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1953907412, now seen corresponding path program 1 times [2021-07-09 16:47:58,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:58,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742622967] [2021-07-09 16:47:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:58,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:58,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742622967] [2021-07-09 16:47:58,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742622967] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:58,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:58,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:47:58,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381652434] [2021-07-09 16:47:58,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:47:58,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:58,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:47:58,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:47:58,842 INFO L87 Difference]: Start difference. First operand 4935 states and 16434 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-07-09 16:47:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:58,985 INFO L93 Difference]: Finished difference Result 5475 states and 18126 transitions. [2021-07-09 16:47:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:47:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 74 [2021-07-09 16:47:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:59,078 INFO L225 Difference]: With dead ends: 5475 [2021-07-09 16:47:59,079 INFO L226 Difference]: Without dead ends: 4755 [2021-07-09 16:47:59,079 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 103.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2021-07-09 16:47:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 4755. [2021-07-09 16:47:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4755 states, 4754 states have (on average 3.3193100546907868) internal successors, (15780), 4754 states have internal predecessors, (15780), 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-07-09 16:47:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 15780 transitions. [2021-07-09 16:47:59,182 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 15780 transitions. Word has length 74 [2021-07-09 16:47:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:59,182 INFO L482 AbstractCegarLoop]: Abstraction has 4755 states and 15780 transitions. [2021-07-09 16:47:59,182 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-07-09 16:47:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 15780 transitions. [2021-07-09 16:47:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:47:59,192 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:59,192 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:59,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:47:59,192 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:59,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:59,193 INFO L82 PathProgramCache]: Analyzing trace with hash 582533093, now seen corresponding path program 1 times [2021-07-09 16:47:59,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:59,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327903462] [2021-07-09 16:47:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:47:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:47:59,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:47:59,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327903462] [2021-07-09 16:47:59,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327903462] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:47:59,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:47:59,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:47:59,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711040664] [2021-07-09 16:47:59,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:47:59,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:47:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:47:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:47:59,414 INFO L87 Difference]: Start difference. First operand 4755 states and 15780 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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-07-09 16:47:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:47:59,715 INFO L93 Difference]: Finished difference Result 5349 states and 17667 transitions. [2021-07-09 16:47:59,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:47:59,716 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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 75 [2021-07-09 16:47:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:47:59,739 INFO L225 Difference]: With dead ends: 5349 [2021-07-09 16:47:59,739 INFO L226 Difference]: Without dead ends: 4749 [2021-07-09 16:47:59,740 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 235.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:47:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2021-07-09 16:47:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 4749. [2021-07-09 16:47:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4749 states, 4748 states have (on average 3.3184498736310024) internal successors, (15756), 4748 states have internal predecessors, (15756), 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-07-09 16:47:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4749 states to 4749 states and 15756 transitions. [2021-07-09 16:47:59,917 INFO L78 Accepts]: Start accepts. Automaton has 4749 states and 15756 transitions. Word has length 75 [2021-07-09 16:47:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:47:59,918 INFO L482 AbstractCegarLoop]: Abstraction has 4749 states and 15756 transitions. [2021-07-09 16:47:59,918 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 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-07-09 16:47:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4749 states and 15756 transitions. [2021-07-09 16:47:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:47:59,929 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:47:59,929 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:47:59,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:47:59,929 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:47:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:47:59,930 INFO L82 PathProgramCache]: Analyzing trace with hash 751570733, now seen corresponding path program 1 times [2021-07-09 16:47:59,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:47:59,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905015308] [2021-07-09 16:47:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:47:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:00,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-07-09 16:48:00,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:00,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905015308] [2021-07-09 16:48:00,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905015308] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:00,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:00,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:48:00,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87012458] [2021-07-09 16:48:00,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:48:00,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:48:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:48:00,034 INFO L87 Difference]: Start difference. First operand 4749 states and 15756 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-07-09 16:48:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:00,151 INFO L93 Difference]: Finished difference Result 7715 states and 25691 transitions. [2021-07-09 16:48:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:48:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2021-07-09 16:48:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:00,171 INFO L225 Difference]: With dead ends: 7715 [2021-07-09 16:48:00,171 INFO L226 Difference]: Without dead ends: 4257 [2021-07-09 16:48:00,172 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:48:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2021-07-09 16:48:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4257. [2021-07-09 16:48:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4257 states, 4256 states have (on average 3.335526315789474) internal successors, (14196), 4256 states have internal predecessors, (14196), 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-07-09 16:48:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4257 states to 4257 states and 14196 transitions. [2021-07-09 16:48:00,288 INFO L78 Accepts]: Start accepts. Automaton has 4257 states and 14196 transitions. Word has length 76 [2021-07-09 16:48:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:00,288 INFO L482 AbstractCegarLoop]: Abstraction has 4257 states and 14196 transitions. [2021-07-09 16:48:00,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-07-09 16:48:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4257 states and 14196 transitions. [2021-07-09 16:48:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:48:00,298 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:00,298 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:00,298 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:48:00,298 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash 739527789, now seen corresponding path program 2 times [2021-07-09 16:48:00,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:00,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908863708] [2021-07-09 16:48:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:48:00,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:00,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908863708] [2021-07-09 16:48:00,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908863708] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:00,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:00,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:48:00,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824595316] [2021-07-09 16:48:00,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:48:00,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:48:00,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:48:00,434 INFO L87 Difference]: Start difference. First operand 4257 states and 14196 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-07-09 16:48:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:00,578 INFO L93 Difference]: Finished difference Result 6203 states and 20725 transitions. [2021-07-09 16:48:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-07-09 16:48:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 76 [2021-07-09 16:48:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:00,595 INFO L225 Difference]: With dead ends: 6203 [2021-07-09 16:48:00,595 INFO L226 Difference]: Without dead ends: 3237 [2021-07-09 16:48:00,596 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.5ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:48:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2021-07-09 16:48:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 3237. [2021-07-09 16:48:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3237 states, 3236 states have (on average 3.2818294190358466) internal successors, (10620), 3236 states have internal predecessors, (10620), 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-07-09 16:48:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3237 states to 3237 states and 10620 transitions. [2021-07-09 16:48:00,683 INFO L78 Accepts]: Start accepts. Automaton has 3237 states and 10620 transitions. Word has length 76 [2021-07-09 16:48:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:00,684 INFO L482 AbstractCegarLoop]: Abstraction has 3237 states and 10620 transitions. [2021-07-09 16:48:00,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-07-09 16:48:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3237 states and 10620 transitions. [2021-07-09 16:48:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:48:00,690 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:00,690 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:00,690 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:48:00,691 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1971943357, now seen corresponding path program 1 times [2021-07-09 16:48:00,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:00,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090800814] [2021-07-09 16:48:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:48:00,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:00,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090800814] [2021-07-09 16:48:00,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090800814] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:00,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:00,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:48:00,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753865593] [2021-07-09 16:48:00,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:48:00,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:00,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:48:00,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:48:00,890 INFO L87 Difference]: Start difference. First operand 3237 states and 10620 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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-07-09 16:48:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:01,412 INFO L93 Difference]: Finished difference Result 3895 states and 12723 transitions. [2021-07-09 16:48:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-07-09 16:48:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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 76 [2021-07-09 16:48:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:01,422 INFO L225 Difference]: With dead ends: 3895 [2021-07-09 16:48:01,423 INFO L226 Difference]: Without dead ends: 3299 [2021-07-09 16:48:01,423 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 382.8ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-07-09 16:48:01,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-07-09 16:48:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2021-07-09 16:48:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 3.280473013947847) internal successors, (10819), 3298 states have internal predecessors, (10819), 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-07-09 16:48:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 10819 transitions. [2021-07-09 16:48:01,514 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 10819 transitions. Word has length 76 [2021-07-09 16:48:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:01,514 INFO L482 AbstractCegarLoop]: Abstraction has 3299 states and 10819 transitions. [2021-07-09 16:48:01,515 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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-07-09 16:48:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 10819 transitions. [2021-07-09 16:48:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:48:01,522 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:01,522 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:01,523 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:48:01,523 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1079028512, now seen corresponding path program 1 times [2021-07-09 16:48:01,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:01,524 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492276433] [2021-07-09 16:48:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:48:01,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:01,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492276433] [2021-07-09 16:48:01,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492276433] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:01,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:01,646 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:48:01,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810463043] [2021-07-09 16:48:01,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:48:01,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:01,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:48:01,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:48:01,647 INFO L87 Difference]: Start difference. First operand 3299 states and 10819 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-07-09 16:48:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:01,766 INFO L93 Difference]: Finished difference Result 3903 states and 12628 transitions. [2021-07-09 16:48:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:48:01,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2021-07-09 16:48:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:01,775 INFO L225 Difference]: With dead ends: 3903 [2021-07-09 16:48:01,775 INFO L226 Difference]: Without dead ends: 2919 [2021-07-09 16:48:01,775 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 93.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:48:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2021-07-09 16:48:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2021-07-09 16:48:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2918 states have (on average 3.2381768334475667) internal successors, (9449), 2918 states have internal predecessors, (9449), 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-07-09 16:48:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 9449 transitions. [2021-07-09 16:48:01,847 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 9449 transitions. Word has length 76 [2021-07-09 16:48:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:01,847 INFO L482 AbstractCegarLoop]: Abstraction has 2919 states and 9449 transitions. [2021-07-09 16:48:01,848 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-07-09 16:48:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 9449 transitions. [2021-07-09 16:48:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:48:01,853 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:01,854 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:01,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:48:01,854 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -132854058, now seen corresponding path program 1 times [2021-07-09 16:48:01,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:01,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336599037] [2021-07-09 16:48:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:48:01,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:01,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336599037] [2021-07-09 16:48:01,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336599037] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:01,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:01,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:48:01,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338112823] [2021-07-09 16:48:01,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:48:01,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:48:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:48:01,954 INFO L87 Difference]: Start difference. First operand 2919 states and 9449 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-07-09 16:48:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:02,089 INFO L93 Difference]: Finished difference Result 2895 states and 9091 transitions. [2021-07-09 16:48:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:48:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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 77 [2021-07-09 16:48:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:02,095 INFO L225 Difference]: With dead ends: 2895 [2021-07-09 16:48:02,095 INFO L226 Difference]: Without dead ends: 2091 [2021-07-09 16:48:02,096 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 101.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:48:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2021-07-09 16:48:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2079. [2021-07-09 16:48:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2078 states have (on average 3.0923965351299327) internal successors, (6426), 2078 states have internal predecessors, (6426), 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-07-09 16:48:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 6426 transitions. [2021-07-09 16:48:02,150 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 6426 transitions. Word has length 77 [2021-07-09 16:48:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:02,151 INFO L482 AbstractCegarLoop]: Abstraction has 2079 states and 6426 transitions. [2021-07-09 16:48:02,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-07-09 16:48:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 6426 transitions. [2021-07-09 16:48:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-07-09 16:48:02,156 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:02,156 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:02,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:48:02,156 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:02,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:02,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1315090985, now seen corresponding path program 1 times [2021-07-09 16:48:02,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:02,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299370505] [2021-07-09 16:48:02,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:48:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:48:02,287 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:48:02,287 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299370505] [2021-07-09 16:48:02,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299370505] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:48:02,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:48:02,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:48:02,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236644910] [2021-07-09 16:48:02,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:48:02,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:48:02,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:48:02,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:48:02,289 INFO L87 Difference]: Start difference. First operand 2079 states and 6426 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-07-09 16:48:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:48:02,444 INFO L93 Difference]: Finished difference Result 1647 states and 4923 transitions. [2021-07-09 16:48:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:48:02,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 79 [2021-07-09 16:48:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:48:02,448 INFO L225 Difference]: With dead ends: 1647 [2021-07-09 16:48:02,448 INFO L226 Difference]: Without dead ends: 1215 [2021-07-09 16:48:02,450 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 128.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:48:02,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-07-09 16:48:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2021-07-09 16:48:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1214 states have (on average 2.9209225700164745) internal successors, (3546), 1214 states have internal predecessors, (3546), 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-07-09 16:48:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3546 transitions. [2021-07-09 16:48:02,480 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3546 transitions. Word has length 79 [2021-07-09 16:48:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:48:02,480 INFO L482 AbstractCegarLoop]: Abstraction has 1215 states and 3546 transitions. [2021-07-09 16:48:02,481 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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-07-09 16:48:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3546 transitions. [2021-07-09 16:48:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:48:02,486 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:48:02,486 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:48:02,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:48:02,487 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:48:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:48:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1181640368, now seen corresponding path program 1 times [2021-07-09 16:48:02,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:48:02,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885545044] [2021-07-09 16:48:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:48:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:48:02,534 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:48:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:48:02,595 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:48:02,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:48:02,648 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:48:02,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:48:02,648 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 16:48:02,651 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:48:02,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:48:02 BasicIcfg [2021-07-09 16:48:02,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:48:02,801 INFO L168 Benchmark]: Toolchain (without parser) took 11119.33 ms. Allocated memory was 185.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 149.0 MB in the beginning and 606.9 MB in the end (delta: -458.0 MB). Peak memory consumption was 772.4 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,801 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 185.6 MB. Free memory is still 167.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:48:02,801 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.95 ms. Allocated memory is still 185.6 MB. Free memory was 148.7 MB in the beginning and 156.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 185.6 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,806 INFO L168 Benchmark]: Boogie Preprocessor took 32.32 ms. Allocated memory is still 185.6 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,808 INFO L168 Benchmark]: RCFGBuilder took 2037.77 ms. Allocated memory was 185.6 MB in the beginning and 266.3 MB in the end (delta: 80.7 MB). Free memory was 150.9 MB in the beginning and 226.9 MB in the end (delta: -76.0 MB). Peak memory consumption was 92.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,808 INFO L168 Benchmark]: TraceAbstraction took 8424.37 ms. Allocated memory was 266.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 226.4 MB in the beginning and 606.9 MB in the end (delta: -380.5 MB). Peak memory consumption was 768.2 MB. Max. memory is 8.0 GB. [2021-07-09 16:48:02,813 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.18 ms. Allocated memory is still 185.6 MB. Free memory is still 167.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 568.95 ms. Allocated memory is still 185.6 MB. Free memory was 148.7 MB in the beginning and 156.1 MB in the end (delta: -7.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 185.6 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.32 ms. Allocated memory is still 185.6 MB. Free memory was 153.5 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2037.77 ms. Allocated memory was 185.6 MB in the beginning and 266.3 MB in the end (delta: 80.7 MB). Free memory was 150.9 MB in the beginning and 226.9 MB in the end (delta: -76.0 MB). Peak memory consumption was 92.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8424.37 ms. Allocated memory was 266.3 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 226.4 MB in the beginning and 606.9 MB in the end (delta: -380.5 MB). Peak memory consumption was 768.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [L818] 0 pthread_t t1807; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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] [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; 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=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] [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}, 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; 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=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] [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}, 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] [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}, 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}, 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}, 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] [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] [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 [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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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] [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 VAL [__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=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [L3] COND FALSE 0 !(!cond) VAL [__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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [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] 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] 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] 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] 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] 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] 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 VAL [__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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [L18] COND TRUE 0 !expression VAL [__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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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] [L18] 0 reach_error() VAL [__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=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8177.2ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 206.7ms, AutomataDifference: 3307.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 292.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1604 SDtfs, 2044 SDslu, 5513 SDs, 0 SdLazy, 635 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 672.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1650.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9815occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2033.3ms AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.6ms SsaConstructionTime, 656.0ms SatisfiabilityAnalysisTime, 1292.6ms InterpolantComputationTime, 970 NumberOfCodeBlocks, 970 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 3462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...