/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 19:06:19,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 19:06:19,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 19:06:20,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 19:06:20,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 19:06:20,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 19:06:20,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 19:06:20,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 19:06:20,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 19:06:20,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 19:06:20,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 19:06:20,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 19:06:20,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 19:06:20,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 19:06:20,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 19:06:20,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 19:06:20,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 19:06:20,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 19:06:20,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 19:06:20,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 19:06:20,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 19:06:20,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 19:06:20,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 19:06:20,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 19:06:20,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 19:06:20,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 19:06:20,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 19:06:20,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 19:06:20,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 19:06:20,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 19:06:20,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 19:06:20,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 19:06:20,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 19:06:20,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 19:06:20,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 19:06:20,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 19:06:20,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 19:06:20,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 19:06:20,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 19:06:20,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 19:06:20,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 19:06:20,085 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-Delay.epf [2021-08-06 19:06:20,124 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 19:06:20,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 19:06:20,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 19:06:20,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 19:06:20,128 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 19:06:20,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 19:06:20,129 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 19:06:20,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 19:06:20,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 19:06:20,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 19:06:20,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 19:06:20,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 19:06:20,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 19:06:20,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 19:06:20,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 19:06:20,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 19:06:20,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:06:20,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 19:06:20,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 19:06:20,133 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-06 19:06:20,133 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-08-06 19:06:20,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 19:06:20,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 19:06:20,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 19:06:20,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 19:06:20,507 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 19:06:20,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-08-06 19:06:20,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b121dcf/8391ff4064a44ce79c25a94b346a75c5/FLAG55df5ecfd [2021-08-06 19:06:21,059 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 19:06:21,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-08-06 19:06:21,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b121dcf/8391ff4064a44ce79c25a94b346a75c5/FLAG55df5ecfd [2021-08-06 19:06:21,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19b121dcf/8391ff4064a44ce79c25a94b346a75c5 [2021-08-06 19:06:21,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 19:06:21,373 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 19:06:21,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 19:06:21,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 19:06:21,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 19:06:21,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:21,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae42cd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21, skipping insertion in model container [2021-08-06 19:06:21,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:21,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 19:06:21,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 19:06:21,604 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/safe030_pso.opt.i[949,962] [2021-08-06 19:06:21,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:06:21,810 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 19:06:21,840 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/safe030_pso.opt.i[949,962] [2021-08-06 19:06:21,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:06:21,963 INFO L208 MainTranslator]: Completed translation [2021-08-06 19:06:21,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21 WrapperNode [2021-08-06 19:06:21,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 19:06:21,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 19:06:21,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 19:06:21,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 19:06:21,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 19:06:22,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 19:06:22,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 19:06:22,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 19:06:22,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 19:06:22,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 19:06:22,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 19:06:22,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 19:06:22,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (1/1) ... [2021-08-06 19:06:22,088 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:06:22,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 19:06:22,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-06 19:06:22,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-06 19:06:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 19:06:22,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 19:06:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 19:06:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 19:06:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 19:06:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 19:06:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 19:06:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 19:06:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 19:06:22,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 19:06:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 19:06:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 19:06:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 19:06:22,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 19:06:22,158 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 19:06:23,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 19:06:23,888 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 19:06:23,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:06:23 BoogieIcfgContainer [2021-08-06 19:06:23,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 19:06:23,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 19:06:23,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 19:06:23,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 19:06:23,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 07:06:21" (1/3) ... [2021-08-06 19:06:23,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f07c034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:06:23, skipping insertion in model container [2021-08-06 19:06:23,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:06:21" (2/3) ... [2021-08-06 19:06:23,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f07c034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:06:23, skipping insertion in model container [2021-08-06 19:06:23,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:06:23" (3/3) ... [2021-08-06 19:06:23,901 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2021-08-06 19:06:23,906 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 19:06:23,906 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 19:06:23,906 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 19:06:23,907 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 19:06:23,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,951 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,968 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,969 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,970 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,971 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:06:23,980 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 19:06:24,015 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork0 ======== [2021-08-06 19:06:24,021 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 19:06:24,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-06 19:06:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 5015 states, 4943 states have (on average 2.2045316609346552) internal successors, (10897), 5014 states have internal predecessors, (10897), 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-08-06 19:06:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-06 19:06:24,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:24,760 INFO L512 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] [2021-08-06 19:06:24,761 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 19:06:24,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1942900053, now seen corresponding path program 1 times [2021-08-06 19:06:24,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:24,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170265732] [2021-08-06 19:06:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:24,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:25,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:25,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170265732] [2021-08-06 19:06:25,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170265732] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:25,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:25,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-06 19:06:25,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211147024] [2021-08-06 19:06:25,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-06 19:06:25,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-06 19:06:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 19:06:25,084 INFO L87 Difference]: Start difference. First operand has 5015 states, 4943 states have (on average 2.2045316609346552) internal successors, (10897), 5014 states have internal predecessors, (10897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08-06 19:06:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:25,151 INFO L93 Difference]: Finished difference Result 3391 states and 6700 transitions. [2021-08-06 19:06:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-06 19:06:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2021-08-06 19:06:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:25,158 INFO L225 Difference]: With dead ends: 3391 [2021-08-06 19:06:25,158 INFO L226 Difference]: Without dead ends: 0 [2021-08-06 19:06:25,159 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 19:06:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-06 19:06:25,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-06 19:06:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08-06 19:06:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-06 19:06:25,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2021-08-06 19:06:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:25,178 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-06 19:06:25,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08-06 19:06:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-06 19:06:25,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-06 19:06:25,181 INFO L764 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 19:06:25,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 19:06:25,183 INFO L308 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-08-06 19:06:25,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 19:06:25,187 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 19:06:25,187 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 19:06:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 8543 states, 7363 states have (on average 2.1686812440581287) internal successors, (15968), 8542 states have internal predecessors, (15968), 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-08-06 19:06:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-06 19:06:26,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:26,101 INFO L512 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] [2021-08-06 19:06:26,101 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:26,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -744105614, now seen corresponding path program 1 times [2021-08-06 19:06:26,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:26,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863754882] [2021-08-06 19:06:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:26,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:26,407 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 34, result has 47.7 percent of original size [2021-08-06 19:06:26,417 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 34, result has 47.7 percent of original size [2021-08-06 19:06:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:26,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:26,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863754882] [2021-08-06 19:06:26,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863754882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:26,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:26,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 19:06:26,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746021838] [2021-08-06 19:06:26,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 19:06:26,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 19:06:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 19:06:26,522 INFO L87 Difference]: Start difference. First operand has 8543 states, 7363 states have (on average 2.1686812440581287) internal successors, (15968), 8542 states have internal predecessors, (15968), 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 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-08-06 19:06:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:27,026 INFO L93 Difference]: Finished difference Result 9929 states and 19226 transitions. [2021-08-06 19:06:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 19:06:27,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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 66 [2021-08-06 19:06:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:27,062 INFO L225 Difference]: With dead ends: 9929 [2021-08-06 19:06:27,062 INFO L226 Difference]: Without dead ends: 4709 [2021-08-06 19:06:27,063 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 227.8ms TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-08-06 19:06:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4709 states. [2021-08-06 19:06:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4709 to 4667. [2021-08-06 19:06:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 4609 states have (on average 2.316988500759384) internal successors, (10679), 4666 states have internal predecessors, (10679), 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-08-06 19:06:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 10679 transitions. [2021-08-06 19:06:27,267 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 10679 transitions. Word has length 66 [2021-08-06 19:06:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:27,269 INFO L470 AbstractCegarLoop]: Abstraction has 4667 states and 10679 transitions. [2021-08-06 19:06:27,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-08-06 19:06:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 10679 transitions. [2021-08-06 19:06:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-06 19:06:27,276 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:27,277 INFO L512 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] [2021-08-06 19:06:27,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 19:06:27,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:27,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:27,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1783582260, now seen corresponding path program 1 times [2021-08-06 19:06:27,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:27,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100355227] [2021-08-06 19:06:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:27,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:27,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:27,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100355227] [2021-08-06 19:06:27,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100355227] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:27,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:27,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:06:27,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792585826] [2021-08-06 19:06:27,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:06:27,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:27,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:06:27,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:06:27,447 INFO L87 Difference]: Start difference. First operand 4667 states and 10679 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08-06 19:06:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:27,603 INFO L93 Difference]: Finished difference Result 5707 states and 13607 transitions. [2021-08-06 19:06:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:06:27,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2021-08-06 19:06:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:27,628 INFO L225 Difference]: With dead ends: 5707 [2021-08-06 19:06:27,629 INFO L226 Difference]: Without dead ends: 4341 [2021-08-06 19:06:27,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2021-08-06 19:06:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4341. [2021-08-06 19:06:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4341 states, 4284 states have (on average 2.2971521942110176) internal successors, (9841), 4340 states have internal predecessors, (9841), 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-08-06 19:06:27,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 9841 transitions. [2021-08-06 19:06:27,851 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 9841 transitions. Word has length 68 [2021-08-06 19:06:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:27,851 INFO L470 AbstractCegarLoop]: Abstraction has 4341 states and 9841 transitions. [2021-08-06 19:06:27,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-08-06 19:06:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 9841 transitions. [2021-08-06 19:06:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 19:06:27,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:27,862 INFO L512 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-08-06 19:06:27,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 19:06:27,863 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:27,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:27,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1438345563, now seen corresponding path program 1 times [2021-08-06 19:06:27,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:27,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283121764] [2021-08-06 19:06:27,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:27,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:28,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:28,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283121764] [2021-08-06 19:06:28,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283121764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:28,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:28,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:06:28,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022354466] [2021-08-06 19:06:28,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:06:28,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:06:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:06:28,103 INFO L87 Difference]: Start difference. First operand 4341 states and 9841 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-08-06 19:06:28,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:28,228 INFO L93 Difference]: Finished difference Result 5041 states and 11965 transitions. [2021-08-06 19:06:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:06:28,229 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-08-06 19:06:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:28,250 INFO L225 Difference]: With dead ends: 5041 [2021-08-06 19:06:28,250 INFO L226 Difference]: Without dead ends: 4083 [2021-08-06 19:06:28,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2021-08-06 19:06:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4083. [2021-08-06 19:06:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4083 states, 4032 states have (on average 2.3092757936507935) internal successors, (9311), 4082 states have internal predecessors, (9311), 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-08-06 19:06:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 9311 transitions. [2021-08-06 19:06:28,372 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 9311 transitions. Word has length 69 [2021-08-06 19:06:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:28,372 INFO L470 AbstractCegarLoop]: Abstraction has 4083 states and 9311 transitions. [2021-08-06 19:06:28,373 INFO L471 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-08-06 19:06:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 9311 transitions. [2021-08-06 19:06:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 19:06:28,380 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:28,380 INFO L512 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-08-06 19:06:28,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 19:06:28,380 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:28,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 215233818, now seen corresponding path program 1 times [2021-08-06 19:06:28,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:28,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002865644] [2021-08-06 19:06:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:28,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:28,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:28,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002865644] [2021-08-06 19:06:28,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002865644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:28,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:28,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:06:28,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492402369] [2021-08-06 19:06:28,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:06:28,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:06:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:06:28,501 INFO L87 Difference]: Start difference. First operand 4083 states and 9311 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-08-06 19:06:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:28,661 INFO L93 Difference]: Finished difference Result 7103 states and 17203 transitions. [2021-08-06 19:06:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:06:28,662 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-08-06 19:06:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:28,688 INFO L225 Difference]: With dead ends: 7103 [2021-08-06 19:06:28,688 INFO L226 Difference]: Without dead ends: 4621 [2021-08-06 19:06:28,689 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2021-08-06 19:06:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 3637. [2021-08-06 19:06:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 3594 states have (on average 2.307456872565387) internal successors, (8293), 3636 states have internal predecessors, (8293), 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-08-06 19:06:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 8293 transitions. [2021-08-06 19:06:28,801 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 8293 transitions. Word has length 71 [2021-08-06 19:06:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:28,801 INFO L470 AbstractCegarLoop]: Abstraction has 3637 states and 8293 transitions. [2021-08-06 19:06:28,801 INFO L471 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-08-06 19:06:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 8293 transitions. [2021-08-06 19:06:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 19:06:28,808 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:28,808 INFO L512 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-08-06 19:06:28,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 19:06:28,808 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2085831965, now seen corresponding path program 1 times [2021-08-06 19:06:28,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:28,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905648001] [2021-08-06 19:06:28,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:28,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:28,918 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 33, result has 45.9 percent of original size [2021-08-06 19:06:28,928 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 33, result has 45.9 percent of original size [2021-08-06 19:06:28,948 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 34, result has 47.7 percent of original size [2021-08-06 19:06:28,955 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 34, result has 47.7 percent of original size [2021-08-06 19:06:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:29,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:29,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905648001] [2021-08-06 19:06:29,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905648001] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:29,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:29,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:06:29,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193138997] [2021-08-06 19:06:29,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:06:29,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:29,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:06:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:06:29,032 INFO L87 Difference]: Start difference. First operand 3637 states and 8293 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-08-06 19:06:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:29,396 INFO L93 Difference]: Finished difference Result 3976 states and 9112 transitions. [2021-08-06 19:06:29,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 19:06:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-08-06 19:06:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:29,413 INFO L225 Difference]: With dead ends: 3976 [2021-08-06 19:06:29,413 INFO L226 Difference]: Without dead ends: 3376 [2021-08-06 19:06:29,414 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 232.8ms TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-08-06 19:06:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2021-08-06 19:06:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3367. [2021-08-06 19:06:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3367 states, 3325 states have (on average 2.2505263157894735) internal successors, (7483), 3366 states have internal predecessors, (7483), 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-08-06 19:06:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3367 states to 3367 states and 7483 transitions. [2021-08-06 19:06:29,513 INFO L78 Accepts]: Start accepts. Automaton has 3367 states and 7483 transitions. Word has length 71 [2021-08-06 19:06:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:29,513 INFO L470 AbstractCegarLoop]: Abstraction has 3367 states and 7483 transitions. [2021-08-06 19:06:29,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-08-06 19:06:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3367 states and 7483 transitions. [2021-08-06 19:06:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 19:06:29,520 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:29,520 INFO L512 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-08-06 19:06:29,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 19:06:29,521 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1484626332, now seen corresponding path program 1 times [2021-08-06 19:06:29,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:29,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413433537] [2021-08-06 19:06:29,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:29,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:29,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:29,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413433537] [2021-08-06 19:06:29,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413433537] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:29,636 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:29,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:06:29,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633580965] [2021-08-06 19:06:29,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:06:29,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:29,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:06:29,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:06:29,637 INFO L87 Difference]: Start difference. First operand 3367 states and 7483 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-08-06 19:06:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:29,773 INFO L93 Difference]: Finished difference Result 5256 states and 12722 transitions. [2021-08-06 19:06:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:06:29,774 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-08-06 19:06:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:29,787 INFO L225 Difference]: With dead ends: 5256 [2021-08-06 19:06:29,787 INFO L226 Difference]: Without dead ends: 3114 [2021-08-06 19:06:29,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2021-08-06 19:06:29,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2514. [2021-08-06 19:06:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2484 states have (on average 2.2729468599033815) internal successors, (5646), 2513 states have internal predecessors, (5646), 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-08-06 19:06:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 5646 transitions. [2021-08-06 19:06:29,866 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 5646 transitions. Word has length 71 [2021-08-06 19:06:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:29,867 INFO L470 AbstractCegarLoop]: Abstraction has 2514 states and 5646 transitions. [2021-08-06 19:06:29,867 INFO L471 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-08-06 19:06:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 5646 transitions. [2021-08-06 19:06:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 19:06:29,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:29,872 INFO L512 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-08-06 19:06:29,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 19:06:29,872 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2087823605, now seen corresponding path program 2 times [2021-08-06 19:06:29,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:29,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826763421] [2021-08-06 19:06:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:29,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:29,980 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 24, result has 64.2 percent of original size [2021-08-06 19:06:29,986 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 24, result has 64.2 percent of original size [2021-08-06 19:06:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:30,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:30,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826763421] [2021-08-06 19:06:30,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826763421] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:30,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:30,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-06 19:06:30,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087830533] [2021-08-06 19:06:30,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-06 19:06:30,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-06 19:06:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-06 19:06:30,071 INFO L87 Difference]: Start difference. First operand 2514 states and 5646 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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-08-06 19:06:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:30,333 INFO L93 Difference]: Finished difference Result 3234 states and 7578 transitions. [2021-08-06 19:06:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:06:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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-08-06 19:06:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:30,342 INFO L225 Difference]: With dead ends: 3234 [2021-08-06 19:06:30,343 INFO L226 Difference]: Without dead ends: 2594 [2021-08-06 19:06:30,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 158.9ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:06:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2021-08-06 19:06:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2519. [2021-08-06 19:06:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2489 states have (on average 2.2539172358376858) internal successors, (5610), 2518 states have internal predecessors, (5610), 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-08-06 19:06:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 5610 transitions. [2021-08-06 19:06:30,409 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 5610 transitions. Word has length 71 [2021-08-06 19:06:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:30,409 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 5610 transitions. [2021-08-06 19:06:30,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 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-08-06 19:06:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 5610 transitions. [2021-08-06 19:06:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 19:06:30,414 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:30,414 INFO L512 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-08-06 19:06:30,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 19:06:30,415 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:30,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1421925898, now seen corresponding path program 1 times [2021-08-06 19:06:30,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:30,415 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047095480] [2021-08-06 19:06:30,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:30,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:30,561 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 24, result has 74.5 percent of original size [2021-08-06 19:06:30,573 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 24, result has 74.5 percent of original size [2021-08-06 19:06:30,622 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 39, result has 68.5 percent of original size [2021-08-06 19:06:30,636 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 39, result has 68.5 percent of original size [2021-08-06 19:06:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:30,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:30,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047095480] [2021-08-06 19:06:30,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047095480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:30,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:30,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 19:06:30,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994428992] [2021-08-06 19:06:30,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 19:06:30,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 19:06:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:30,743 INFO L87 Difference]: Start difference. First operand 2519 states and 5610 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 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-08-06 19:06:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:31,062 INFO L93 Difference]: Finished difference Result 2879 states and 6678 transitions. [2021-08-06 19:06:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 19:06:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 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-08-06 19:06:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:31,069 INFO L225 Difference]: With dead ends: 2879 [2021-08-06 19:06:31,069 INFO L226 Difference]: Without dead ends: 2399 [2021-08-06 19:06:31,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 265.5ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-08-06 19:06:31,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2021-08-06 19:06:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2399. [2021-08-06 19:06:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2369 states have (on average 2.1798227100042213) internal successors, (5164), 2398 states have internal predecessors, (5164), 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-08-06 19:06:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 5164 transitions. [2021-08-06 19:06:31,124 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 5164 transitions. Word has length 72 [2021-08-06 19:06:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:31,125 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 5164 transitions. [2021-08-06 19:06:31,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 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-08-06 19:06:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 5164 transitions. [2021-08-06 19:06:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 19:06:31,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:31,129 INFO L512 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-08-06 19:06:31,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 19:06:31,130 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1718869525, now seen corresponding path program 1 times [2021-08-06 19:06:31,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:31,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364005273] [2021-08-06 19:06:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:31,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:31,252 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 24, result has 65.7 percent of original size [2021-08-06 19:06:31,257 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 24, result has 65.7 percent of original size [2021-08-06 19:06:31,295 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 24, result has 67.1 percent of original size [2021-08-06 19:06:31,301 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 24, result has 67.1 percent of original size [2021-08-06 19:06:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:31,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:31,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364005273] [2021-08-06 19:06:31,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364005273] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:31,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:31,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 19:06:31,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135304486] [2021-08-06 19:06:31,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 19:06:31,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:31,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 19:06:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-06 19:06:31,409 INFO L87 Difference]: Start difference. First operand 2399 states and 5164 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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-08-06 19:06:31,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:31,671 INFO L93 Difference]: Finished difference Result 2639 states and 5994 transitions. [2021-08-06 19:06:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 19:06:31,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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-08-06 19:06:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:31,677 INFO L225 Difference]: With dead ends: 2639 [2021-08-06 19:06:31,677 INFO L226 Difference]: Without dead ends: 2159 [2021-08-06 19:06:31,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 233.6ms TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-08-06 19:06:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2021-08-06 19:06:31,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2159. [2021-08-06 19:06:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2129 states have (on average 2.219821512447158) internal successors, (4726), 2158 states have internal predecessors, (4726), 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-08-06 19:06:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 4726 transitions. [2021-08-06 19:06:31,725 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 4726 transitions. Word has length 72 [2021-08-06 19:06:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:31,725 INFO L470 AbstractCegarLoop]: Abstraction has 2159 states and 4726 transitions. [2021-08-06 19:06:31,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 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-08-06 19:06:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 4726 transitions. [2021-08-06 19:06:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 19:06:31,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:31,730 INFO L512 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-08-06 19:06:31,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 19:06:31,730 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:31,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2079146455, now seen corresponding path program 1 times [2021-08-06 19:06:31,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:31,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22287361] [2021-08-06 19:06:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:31,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:31,837 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 48, result has 65.0 percent of original size [2021-08-06 19:06:31,848 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 48, result has 65.0 percent of original size [2021-08-06 19:06:31,888 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 25, result has 76.0 percent of original size [2021-08-06 19:06:31,897 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 25, result has 76.0 percent of original size [2021-08-06 19:06:31,943 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 25, result has 76.6 percent of original size [2021-08-06 19:06:31,953 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 25, result has 76.6 percent of original size [2021-08-06 19:06:32,003 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 40, result has 67.7 percent of original size [2021-08-06 19:06:32,013 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 40, result has 67.7 percent of original size [2021-08-06 19:06:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:32,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:32,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22287361] [2021-08-06 19:06:32,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22287361] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:32,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:32,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 19:06:32,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409199259] [2021-08-06 19:06:32,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 19:06:32,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 19:06:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:32,122 INFO L87 Difference]: Start difference. First operand 2159 states and 4726 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 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-08-06 19:06:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:32,438 INFO L93 Difference]: Finished difference Result 3029 states and 6895 transitions. [2021-08-06 19:06:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 19:06:32,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 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-08-06 19:06:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:32,444 INFO L225 Difference]: With dead ends: 3029 [2021-08-06 19:06:32,444 INFO L226 Difference]: Without dead ends: 1699 [2021-08-06 19:06:32,445 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 246.2ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-06 19:06:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2021-08-06 19:06:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1349. [2021-08-06 19:06:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1319 states have (on average 2.2365428354814254) internal successors, (2950), 1348 states have internal predecessors, (2950), 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-08-06 19:06:32,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2950 transitions. [2021-08-06 19:06:32,474 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2950 transitions. Word has length 74 [2021-08-06 19:06:32,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:32,474 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 2950 transitions. [2021-08-06 19:06:32,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 11 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-08-06 19:06:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2950 transitions. [2021-08-06 19:06:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 19:06:32,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:32,477 INFO L512 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-08-06 19:06:32,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 19:06:32,478 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash -160749201, now seen corresponding path program 1 times [2021-08-06 19:06:32,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:32,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913811550] [2021-08-06 19:06:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:32,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:32,566 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:32,567 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:32,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:32,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913811550] [2021-08-06 19:06:32,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913811550] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:32,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:32,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:06:32,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998212959] [2021-08-06 19:06:32,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:06:32,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:06:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:06:32,582 INFO L87 Difference]: Start difference. First operand 1349 states and 2950 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-08-06 19:06:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:32,674 INFO L93 Difference]: Finished difference Result 1621 states and 3444 transitions. [2021-08-06 19:06:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:06:32,675 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-08-06 19:06:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:32,678 INFO L225 Difference]: With dead ends: 1621 [2021-08-06 19:06:32,678 INFO L226 Difference]: Without dead ends: 1121 [2021-08-06 19:06:32,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:06:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-08-06 19:06:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2021-08-06 19:06:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1091 states have (on average 2.2832263978001834) internal successors, (2491), 1120 states have internal predecessors, (2491), 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-08-06 19:06:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 2491 transitions. [2021-08-06 19:06:32,699 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 2491 transitions. Word has length 74 [2021-08-06 19:06:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:32,699 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 2491 transitions. [2021-08-06 19:06:32,700 INFO L471 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-08-06 19:06:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 2491 transitions. [2021-08-06 19:06:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:06:32,702 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:32,702 INFO L512 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-08-06 19:06:32,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 19:06:32,702 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash -348955636, now seen corresponding path program 1 times [2021-08-06 19:06:32,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:32,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243058306] [2021-08-06 19:06:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:32,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:32,791 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:32,792 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:32,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:32,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243058306] [2021-08-06 19:06:32,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243058306] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:32,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:32,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:06:32,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157889150] [2021-08-06 19:06:32,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:06:32,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:32,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:06:32,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:06:32,807 INFO L87 Difference]: Start difference. First operand 1121 states and 2491 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08-06 19:06:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:32,915 INFO L93 Difference]: Finished difference Result 1049 states and 2177 transitions. [2021-08-06 19:06:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 19:06:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08-06 19:06:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:32,918 INFO L225 Difference]: With dead ends: 1049 [2021-08-06 19:06:32,918 INFO L226 Difference]: Without dead ends: 665 [2021-08-06 19:06:32,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 19:06:32,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-08-06 19:06:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2021-08-06 19:06:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 641 states have (on average 2.1794071762870515) internal successors, (1397), 664 states have internal predecessors, (1397), 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-08-06 19:06:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1397 transitions. [2021-08-06 19:06:32,929 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1397 transitions. Word has length 75 [2021-08-06 19:06:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:32,929 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 1397 transitions. [2021-08-06 19:06:32,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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-08-06 19:06:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1397 transitions. [2021-08-06 19:06:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 19:06:32,930 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:32,931 INFO L512 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-08-06 19:06:32,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 19:06:32,931 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:32,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:32,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1859635835, now seen corresponding path program 1 times [2021-08-06 19:06:32,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:32,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968417219] [2021-08-06 19:06:32,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:32,932 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:06:33,026 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:33,027 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:06:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 19:06:33,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:06:33,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968417219] [2021-08-06 19:06:33,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968417219] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:06:33,042 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:06:33,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:06:33,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384396967] [2021-08-06 19:06:33,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:06:33,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:06:33,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:06:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:06:33,043 INFO L87 Difference]: Start difference. First operand 665 states and 1397 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 19:06:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:06:33,168 INFO L93 Difference]: Finished difference Result 461 states and 861 transitions. [2021-08-06 19:06:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:06:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 19:06:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:06:33,170 INFO L225 Difference]: With dead ends: 461 [2021-08-06 19:06:33,170 INFO L226 Difference]: Without dead ends: 239 [2021-08-06 19:06:33,170 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 101.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:06:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-08-06 19:06:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-08-06 19:06:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 230 states have (on average 1.791304347826087) internal successors, (412), 238 states have internal predecessors, (412), 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-08-06 19:06:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 412 transitions. [2021-08-06 19:06:33,174 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 412 transitions. Word has length 77 [2021-08-06 19:06:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:06:33,174 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 412 transitions. [2021-08-06 19:06:33,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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-08-06 19:06:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 412 transitions. [2021-08-06 19:06:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 19:06:33,175 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:06:33,175 INFO L512 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] [2021-08-06 19:06:33,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 19:06:33,175 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:06:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:06:33,176 INFO L82 PathProgramCache]: Analyzing trace with hash 840702381, now seen corresponding path program 1 times [2021-08-06 19:06:33,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:06:33,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815373733] [2021-08-06 19:06:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:06:33,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:06:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:06:33,208 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 19:06:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:06:33,294 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 19:06:33,294 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 19:06:33,294 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 19:06:33,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 19:06:33,294 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 19:06:33,295 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 19:06:33,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 19:06:33,298 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2021-08-06 19:06:33,301 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 19:06:33,301 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 19:06:33,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 07:06:33 BasicIcfg [2021-08-06 19:06:33,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 19:06:33,441 INFO L168 Benchmark]: Toolchain (without parser) took 12068.22 ms. Allocated memory was 217.1 MB in the beginning and 630.2 MB in the end (delta: 413.1 MB). Free memory was 181.2 MB in the beginning and 233.2 MB in the end (delta: -51.9 MB). Peak memory consumption was 361.8 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 217.1 MB. Free memory is still 199.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.72 ms. Allocated memory is still 217.1 MB. Free memory was 181.1 MB in the beginning and 191.1 MB in the end (delta: -10.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.63 ms. Allocated memory is still 217.1 MB. Free memory was 191.1 MB in the beginning and 188.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: Boogie Preprocessor took 43.14 ms. Allocated memory is still 217.1 MB. Free memory was 188.0 MB in the beginning and 185.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: RCFGBuilder took 1809.30 ms. Allocated memory was 217.1 MB in the beginning and 276.8 MB in the end (delta: 59.8 MB). Free memory was 185.9 MB in the beginning and 232.3 MB in the end (delta: -46.4 MB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,441 INFO L168 Benchmark]: TraceAbstraction took 9547.11 ms. Allocated memory was 276.8 MB in the beginning and 630.2 MB in the end (delta: 353.4 MB). Free memory was 231.8 MB in the beginning and 233.2 MB in the end (delta: -1.4 MB). Peak memory consumption was 352.0 MB. Max. memory is 8.0 GB. [2021-08-06 19:06:33,442 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.57 ms. Allocated memory is still 217.1 MB. Free memory is still 199.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 589.72 ms. Allocated memory is still 217.1 MB. Free memory was 181.1 MB in the beginning and 191.1 MB in the end (delta: -10.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.63 ms. Allocated memory is still 217.1 MB. Free memory was 191.1 MB in the beginning and 188.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.14 ms. Allocated memory is still 217.1 MB. Free memory was 188.0 MB in the beginning and 185.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1809.30 ms. Allocated memory was 217.1 MB in the beginning and 276.8 MB in the end (delta: 59.8 MB). Free memory was 185.9 MB in the beginning and 232.3 MB in the end (delta: -46.4 MB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9547.11 ms. Allocated memory was 276.8 MB in the beginning and 630.2 MB in the end (delta: 353.4 MB). Free memory was 231.8 MB in the beginning and 233.2 MB in the end (delta: -1.4 MB). Peak memory consumption was 352.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19113, positive: 18108, positive conditional: 18108, positive unconditional: 0, negative: 1005, negative conditional: 1005, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18609, positive: 18108, positive conditional: 0, positive unconditional: 18108, negative: 501, negative conditional: 0, negative unconditional: 501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 697, positive: 682, positive conditional: 0, positive unconditional: 682, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 697, positive: 681, positive conditional: 0, positive unconditional: 681, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 202, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 200, negative conditional: 0, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18609, positive: 17426, positive conditional: 0, positive unconditional: 17426, negative: 486, negative conditional: 0, negative unconditional: 486, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 697, Positive cache size: 682, Positive conditional cache size: 0, Positive unconditional cache size: 682, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Independence queries for same thread: 504 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31281, positive: 28845, positive conditional: 28845, positive unconditional: 0, negative: 2436, negative conditional: 2436, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30287, positive: 28845, positive conditional: 0, positive unconditional: 28845, negative: 1442, negative conditional: 0, negative unconditional: 1442, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 795, positive: 762, positive conditional: 0, positive unconditional: 762, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 795, positive: 758, positive conditional: 0, positive unconditional: 758, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 417, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 412, negative conditional: 0, negative unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30287, positive: 28083, positive conditional: 0, positive unconditional: 28083, negative: 1409, negative conditional: 0, negative unconditional: 1409, unknown: 795, unknown conditional: 0, unknown unconditional: 795] , Statistics on independence cache: Total cache size (in pairs): 795, Positive cache size: 762, Positive conditional cache size: 0, Positive unconditional cache size: 762, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Independence queries for same thread: 994 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2498; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1169.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 28.2ms, AutomataDifference: 104.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 710.2ms, PartialOrderReductionTime: 696.3ms, HoareTripleCheckerStatistics: 88 SDtfs, 35 SDslu, 25 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5015occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.9ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 6.8ms SsaConstructionTime, 42.2ms SatisfiabilityAnalysisTime, 162.7ms InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8112.0ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 102.0ms, AutomataDifference: 3142.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 872.5ms, PartialOrderReductionTime: 870.5ms, HoareTripleCheckerStatistics: 1604 SDtfs, 2225 SDslu, 5679 SDs, 0 SdLazy, 787 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 884.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1973.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8543occurred in iteration=0, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1061.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 2060 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.6ms SsaConstructionTime, 473.7ms SatisfiabilityAnalysisTime, 2115.8ms InterpolantComputationTime, 1011 NumberOfCodeBlocks, 1011 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 4425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-06 19:06:33,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...