/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 13:06:48,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 13:06:48,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 13:06:48,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 13:06:48,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 13:06:48,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 13:06:48,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 13:06:48,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 13:06:48,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 13:06:48,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 13:06:48,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 13:06:48,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 13:06:48,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 13:06:48,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 13:06:48,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 13:06:48,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 13:06:48,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 13:06:48,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 13:06:48,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 13:06:48,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 13:06:48,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 13:06:48,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 13:06:48,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 13:06:48,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 13:06:48,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 13:06:48,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 13:06:48,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 13:06:48,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 13:06:48,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 13:06:48,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 13:06:48,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 13:06:48,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 13:06:48,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 13:06:48,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 13:06:48,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 13:06:48,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 13:06:48,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 13:06:48,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 13:06:48,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 13:06:48,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 13:06:48,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 13:06:48,724 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 13:06:48,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 13:06:48,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 13:06:48,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 13:06:48,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 13:06:48,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 13:06:48,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 13:06:48,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 13:06:48,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 13:06:48,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 13:06:48,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 13:06:48,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:06:48,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 13:06:48,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 13:06:48,740 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 [2022-01-28 13:06:48,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 13:06:48,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 13:06:48,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 13:06:48,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 13:06:48,931 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 13:06:48,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-01-28 13:06:49,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c917ab9a/972025223ffa4b41afcb0245173e0df9/FLAGd56409625 [2022-01-28 13:06:49,365 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 13:06:49,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-01-28 13:06:49,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c917ab9a/972025223ffa4b41afcb0245173e0df9/FLAGd56409625 [2022-01-28 13:06:49,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c917ab9a/972025223ffa4b41afcb0245173e0df9 [2022-01-28 13:06:49,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 13:06:49,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 13:06:49,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 13:06:49,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 13:06:49,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 13:06:49,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664b009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49, skipping insertion in model container [2022-01-28 13:06:49,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 13:06:49,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 13:06:49,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-01-28 13:06:49,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:06:49,552 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 13:06:49,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c[3770,3783] [2022-01-28 13:06:49,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 13:06:49,580 INFO L208 MainTranslator]: Completed translation [2022-01-28 13:06:49,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49 WrapperNode [2022-01-28 13:06:49,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 13:06:49,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 13:06:49,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 13:06:49,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 13:06:49,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,632 INFO L137 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 245 [2022-01-28 13:06:49,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 13:06:49,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 13:06:49,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 13:06:49,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 13:06:49,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 13:06:49,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 13:06:49,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 13:06:49,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 13:06:49,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (1/1) ... [2022-01-28 13:06:49,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 13:06:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:06:49,708 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) [2022-01-28 13:06:49,718 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 [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-28 13:06:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-28 13:06:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-28 13:06:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-28 13:06:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-28 13:06:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 13:06:49,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 13:06:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 13:06:49,740 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 13:06:49,805 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 13:06:49,806 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 13:06:50,152 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 13:06:50,239 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 13:06:50,239 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-28 13:06:50,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:06:50 BoogieIcfgContainer [2022-01-28 13:06:50,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 13:06:50,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 13:06:50,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 13:06:50,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 13:06:50,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 01:06:49" (1/3) ... [2022-01-28 13:06:50,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0e6e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:06:50, skipping insertion in model container [2022-01-28 13:06:50,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 01:06:49" (2/3) ... [2022-01-28 13:06:50,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0e6e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 01:06:50, skipping insertion in model container [2022-01-28 13:06:50,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 01:06:50" (3/3) ... [2022-01-28 13:06:50,246 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-01-28 13:06:50,250 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 13:06:50,250 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 13:06:50,250 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-28 13:06:50,250 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,294 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,295 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,296 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,297 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,298 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,299 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,300 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,301 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,302 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,303 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,304 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,305 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,306 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,307 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,308 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,309 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,310 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,311 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,312 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,313 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,314 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,314 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~nondet15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,316 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,317 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,318 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,319 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,320 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~pre9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,328 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,329 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,330 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 13:06:50,333 INFO L148 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-01-28 13:06:50,376 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 13:06:50,380 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, mAutomataTypeConcurrency=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 [2022-01-28 13:06:50,380 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-28 13:06:50,393 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 204 places, 205 transitions, 454 flow [2022-01-28 13:06:51,211 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 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) [2022-01-28 13:06:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 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) [2022-01-28 13:06:51,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-28 13:06:51,375 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:06:51,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:06:51,377 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:06:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:06:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash -843314989, now seen corresponding path program 1 times [2022-01-28 13:06:51,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:06:51,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471512000] [2022-01-28 13:06:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:06:51,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:06:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:06:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:06:51,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:06:51,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471512000] [2022-01-28 13:06:51,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471512000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:06:51,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:06:51,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 13:06:51,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707139804] [2022-01-28 13:06:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:06:51,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-28 13:06:51,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:06:51,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-28 13:06:51,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:06:51,702 INFO L87 Difference]: Start difference. First operand has 19453 states, 19452 states have (on average 4.476968949208308) internal successors, (87086), 19452 states have internal predecessors, (87086), 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 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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) [2022-01-28 13:06:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:06:52,024 INFO L93 Difference]: Finished difference Result 19453 states and 81672 transitions. [2022-01-28 13:06:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-28 13:06:52,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2022-01-28 13:06:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:06:52,276 INFO L225 Difference]: With dead ends: 19453 [2022-01-28 13:06:52,276 INFO L226 Difference]: Without dead ends: 19449 [2022-01-28 13:06:52,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-28 13:06:52,293 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:06:52,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:06:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2022-01-28 13:06:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19449. [2022-01-28 13:06:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19449 states, 19448 states have (on average 4.199300699300699) internal successors, (81668), 19448 states have internal predecessors, (81668), 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) [2022-01-28 13:06:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19449 states to 19449 states and 81668 transitions. [2022-01-28 13:06:53,173 INFO L78 Accepts]: Start accepts. Automaton has 19449 states and 81668 transitions. Word has length 145 [2022-01-28 13:06:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:06:53,174 INFO L470 AbstractCegarLoop]: Abstraction has 19449 states and 81668 transitions. [2022-01-28 13:06:53,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 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) [2022-01-28 13:06:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19449 states and 81668 transitions. [2022-01-28 13:06:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:06:53,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:06:53,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:06:53,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 13:06:53,407 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:06:53,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:06:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1753742463, now seen corresponding path program 1 times [2022-01-28 13:06:53,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:06:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338358851] [2022-01-28 13:06:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:06:53,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:06:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:06:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:06:53,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:06:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338358851] [2022-01-28 13:06:53,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338358851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:06:53,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:06:53,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:06:53,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113615636] [2022-01-28 13:06:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:06:53,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:06:53,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:06:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:06:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:06:53,642 INFO L87 Difference]: Start difference. First operand 19449 states and 81668 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2022-01-28 13:06:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:06:54,549 INFO L93 Difference]: Finished difference Result 49650 states and 212030 transitions. [2022-01-28 13:06:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 13:06:54,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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 148 [2022-01-28 13:06:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:06:55,020 INFO L225 Difference]: With dead ends: 49650 [2022-01-28 13:06:55,025 INFO L226 Difference]: Without dead ends: 47169 [2022-01-28 13:06:55,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:06:55,030 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 162 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:06:55,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 868 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:06:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47169 states. [2022-01-28 13:06:56,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47169 to 22104. [2022-01-28 13:06:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22104 states, 22103 states have (on average 4.187621589829435) internal successors, (92559), 22103 states have internal predecessors, (92559), 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) [2022-01-28 13:06:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22104 states to 22104 states and 92559 transitions. [2022-01-28 13:06:56,419 INFO L78 Accepts]: Start accepts. Automaton has 22104 states and 92559 transitions. Word has length 148 [2022-01-28 13:06:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:06:56,420 INFO L470 AbstractCegarLoop]: Abstraction has 22104 states and 92559 transitions. [2022-01-28 13:06:56,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2022-01-28 13:06:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22104 states and 92559 transitions. [2022-01-28 13:06:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-28 13:06:56,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:06:56,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:06:56,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 13:06:56,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:06:56,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:06:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1679654809, now seen corresponding path program 2 times [2022-01-28 13:06:56,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:06:56,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897697493] [2022-01-28 13:06:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:06:56,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:06:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:06:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:06:56,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:06:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897697493] [2022-01-28 13:06:56,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897697493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:06:56,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:06:56,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 13:06:56,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720507872] [2022-01-28 13:06:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:06:56,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 13:06:56,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:06:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 13:06:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 13:06:56,630 INFO L87 Difference]: Start difference. First operand 22104 states and 92559 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2022-01-28 13:06:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:06:57,284 INFO L93 Difference]: Finished difference Result 56186 states and 238313 transitions. [2022-01-28 13:06:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-28 13:06:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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 148 [2022-01-28 13:06:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:06:57,713 INFO L225 Difference]: With dead ends: 56186 [2022-01-28 13:06:57,713 INFO L226 Difference]: Without dead ends: 53705 [2022-01-28 13:06:57,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-28 13:06:57,714 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 125 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:06:57,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 863 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:06:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53705 states. [2022-01-28 13:06:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53705 to 24167. [2022-01-28 13:06:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24167 states, 24166 states have (on average 4.15596292311512) internal successors, (100433), 24166 states have internal predecessors, (100433), 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) [2022-01-28 13:06:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24167 states to 24167 states and 100433 transitions. [2022-01-28 13:06:58,894 INFO L78 Accepts]: Start accepts. Automaton has 24167 states and 100433 transitions. Word has length 148 [2022-01-28 13:06:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:06:58,894 INFO L470 AbstractCegarLoop]: Abstraction has 24167 states and 100433 transitions. [2022-01-28 13:06:58,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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) [2022-01-28 13:06:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 24167 states and 100433 transitions. [2022-01-28 13:06:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-28 13:06:58,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:06:58,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:06:58,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 13:06:58,956 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:06:58,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:06:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash 763966394, now seen corresponding path program 1 times [2022-01-28 13:06:58,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:06:58,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590267514] [2022-01-28 13:06:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:06:58,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:06:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:06:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:06:59,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:06:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590267514] [2022-01-28 13:06:59,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590267514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:06:59,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:06:59,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 13:06:59,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747275715] [2022-01-28 13:06:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:06:59,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:06:59,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:06:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:06:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:06:59,217 INFO L87 Difference]: Start difference. First operand 24167 states and 100433 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2022-01-28 13:06:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:06:59,694 INFO L93 Difference]: Finished difference Result 46408 states and 191388 transitions. [2022-01-28 13:06:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-28 13:06:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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 152 [2022-01-28 13:06:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:00,073 INFO L225 Difference]: With dead ends: 46408 [2022-01-28 13:07:00,074 INFO L226 Difference]: Without dead ends: 41314 [2022-01-28 13:07:00,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:07:00,075 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 680 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:00,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 701 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:07:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41314 states. [2022-01-28 13:07:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41314 to 31225. [2022-01-28 13:07:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 31224 states have (on average 4.112477581347681) internal successors, (128408), 31224 states have internal predecessors, (128408), 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) [2022-01-28 13:07:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 128408 transitions. [2022-01-28 13:07:01,188 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 128408 transitions. Word has length 152 [2022-01-28 13:07:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:01,188 INFO L470 AbstractCegarLoop]: Abstraction has 31225 states and 128408 transitions. [2022-01-28 13:07:01,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2022-01-28 13:07:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 128408 transitions. [2022-01-28 13:07:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-28 13:07:01,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:01,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:01,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 13:07:01,280 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:01,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1629900824, now seen corresponding path program 1 times [2022-01-28 13:07:01,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:01,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423481361] [2022-01-28 13:07:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:01,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:01,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423481361] [2022-01-28 13:07:01,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423481361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 13:07:01,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 13:07:01,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 13:07:01,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188530974] [2022-01-28 13:07:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:07:01,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 13:07:01,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 13:07:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-28 13:07:01,370 INFO L87 Difference]: Start difference. First operand 31225 states and 128408 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2022-01-28 13:07:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:07:01,857 INFO L93 Difference]: Finished difference Result 31662 states and 126747 transitions. [2022-01-28 13:07:01,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-28 13:07:01,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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 152 [2022-01-28 13:07:01,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:01,938 INFO L225 Difference]: With dead ends: 31662 [2022-01-28 13:07:01,938 INFO L226 Difference]: Without dead ends: 20789 [2022-01-28 13:07:01,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-28 13:07:01,939 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 517 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:01,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 645 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:07:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20789 states. [2022-01-28 13:07:02,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20789 to 20784. [2022-01-28 13:07:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20784 states, 20783 states have (on average 4.053264687484964) internal successors, (84239), 20783 states have internal predecessors, (84239), 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) [2022-01-28 13:07:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20784 states to 20784 states and 84239 transitions. [2022-01-28 13:07:02,541 INFO L78 Accepts]: Start accepts. Automaton has 20784 states and 84239 transitions. Word has length 152 [2022-01-28 13:07:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:02,541 INFO L470 AbstractCegarLoop]: Abstraction has 20784 states and 84239 transitions. [2022-01-28 13:07:02,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 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) [2022-01-28 13:07:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20784 states and 84239 transitions. [2022-01-28 13:07:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-28 13:07:02,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:02,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:02,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 13:07:02,589 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:02,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1101759176, now seen corresponding path program 1 times [2022-01-28 13:07:02,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:02,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564602060] [2022-01-28 13:07:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:02,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:02,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:02,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564602060] [2022-01-28 13:07:02,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564602060] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:02,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252574967] [2022-01-28 13:07:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:02,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:02,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:07:02,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:07:02,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-28 13:07:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:02,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-28 13:07:02,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:07:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:03,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:07:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:03,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252574967] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:07:03,656 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:07:03,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-28 13:07:03,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042607331] [2022-01-28 13:07:03,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:07:03,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-28 13:07:03,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-28 13:07:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-01-28 13:07:03,658 INFO L87 Difference]: Start difference. First operand 20784 states and 84239 transitions. Second operand has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 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) [2022-01-28 13:07:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:07:04,238 INFO L93 Difference]: Finished difference Result 39863 states and 160291 transitions. [2022-01-28 13:07:04,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-28 13:07:04,238 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 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 159 [2022-01-28 13:07:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:04,373 INFO L225 Difference]: With dead ends: 39863 [2022-01-28 13:07:04,373 INFO L226 Difference]: Without dead ends: 34571 [2022-01-28 13:07:04,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-01-28 13:07:04,374 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1121 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:04,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 1460 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-28 13:07:04,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34571 states. [2022-01-28 13:07:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34571 to 26462. [2022-01-28 13:07:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26462 states, 26461 states have (on average 4.016930577075696) internal successors, (106292), 26461 states have internal predecessors, (106292), 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) [2022-01-28 13:07:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26462 states to 26462 states and 106292 transitions. [2022-01-28 13:07:05,448 INFO L78 Accepts]: Start accepts. Automaton has 26462 states and 106292 transitions. Word has length 159 [2022-01-28 13:07:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:05,448 INFO L470 AbstractCegarLoop]: Abstraction has 26462 states and 106292 transitions. [2022-01-28 13:07:05,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.11111111111111) internal successors, (200), 18 states have internal predecessors, (200), 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) [2022-01-28 13:07:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 26462 states and 106292 transitions. [2022-01-28 13:07:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-28 13:07:05,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:05,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:05,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-28 13:07:05,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-28 13:07:05,721 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:05,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1684428250, now seen corresponding path program 1 times [2022-01-28 13:07:05,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:05,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576254775] [2022-01-28 13:07:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:05,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:05,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:05,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576254775] [2022-01-28 13:07:05,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576254775] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:05,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045480490] [2022-01-28 13:07:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:05,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:05,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:07:05,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:07:05,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-28 13:07:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:05,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-28 13:07:05,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:07:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:06,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:07:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:06,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045480490] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:07:06,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:07:06,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-28 13:07:06,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980305881] [2022-01-28 13:07:06,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:07:06,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-28 13:07:06,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:06,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-28 13:07:06,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-01-28 13:07:06,563 INFO L87 Difference]: Start difference. First operand 26462 states and 106292 transitions. Second operand has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 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) [2022-01-28 13:07:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:07:07,156 INFO L93 Difference]: Finished difference Result 24919 states and 99000 transitions. [2022-01-28 13:07:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-28 13:07:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 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 159 [2022-01-28 13:07:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:07,228 INFO L225 Difference]: With dead ends: 24919 [2022-01-28 13:07:07,228 INFO L226 Difference]: Without dead ends: 20796 [2022-01-28 13:07:07,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2022-01-28 13:07:07,229 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 597 mSDsluCounter, 1797 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:07,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 1753 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-28 13:07:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20796 states. [2022-01-28 13:07:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20796 to 20791. [2022-01-28 13:07:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20791 states, 20790 states have (on average 4.052236652236652) internal successors, (84246), 20790 states have internal predecessors, (84246), 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) [2022-01-28 13:07:07,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20791 states to 20791 states and 84246 transitions. [2022-01-28 13:07:07,809 INFO L78 Accepts]: Start accepts. Automaton has 20791 states and 84246 transitions. Word has length 159 [2022-01-28 13:07:07,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:07,809 INFO L470 AbstractCegarLoop]: Abstraction has 20791 states and 84246 transitions. [2022-01-28 13:07:07,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.944444444444445) internal successors, (215), 18 states have internal predecessors, (215), 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) [2022-01-28 13:07:07,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20791 states and 84246 transitions. [2022-01-28 13:07:07,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-01-28 13:07:07,856 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:07,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:07,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-28 13:07:08,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-28 13:07:08,072 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 432613882, now seen corresponding path program 2 times [2022-01-28 13:07:08,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:08,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905294383] [2022-01-28 13:07:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:08,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:08,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:08,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905294383] [2022-01-28 13:07:08,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905294383] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:08,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374548697] [2022-01-28 13:07:08,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:07:08,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:08,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:07:08,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:07:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-28 13:07:08,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:07:08,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:07:08,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-28 13:07:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:07:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:08,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:07:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:07:09,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374548697] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:09,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-28 13:07:09,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 18 [2022-01-28 13:07:09,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040765967] [2022-01-28 13:07:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:07:09,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-28 13:07:09,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-28 13:07:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-01-28 13:07:09,097 INFO L87 Difference]: Start difference. First operand 20791 states and 84246 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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) [2022-01-28 13:07:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:07:09,389 INFO L93 Difference]: Finished difference Result 24097 states and 99434 transitions. [2022-01-28 13:07:09,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 13:07:09,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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 166 [2022-01-28 13:07:09,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:09,474 INFO L225 Difference]: With dead ends: 24097 [2022-01-28 13:07:09,475 INFO L226 Difference]: Without dead ends: 23297 [2022-01-28 13:07:09,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-01-28 13:07:09,475 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 590 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:09,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 535 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:07:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23297 states. [2022-01-28 13:07:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23297 to 18721. [2022-01-28 13:07:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18721 states, 18720 states have (on average 4.096581196581196) internal successors, (76688), 18720 states have internal predecessors, (76688), 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) [2022-01-28 13:07:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18721 states to 18721 states and 76688 transitions. [2022-01-28 13:07:10,141 INFO L78 Accepts]: Start accepts. Automaton has 18721 states and 76688 transitions. Word has length 166 [2022-01-28 13:07:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:10,141 INFO L470 AbstractCegarLoop]: Abstraction has 18721 states and 76688 transitions. [2022-01-28 13:07:10,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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) [2022-01-28 13:07:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18721 states and 76688 transitions. [2022-01-28 13:07:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-01-28 13:07:10,183 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:10,183 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:10,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-28 13:07:10,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:10,400 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -150055192, now seen corresponding path program 2 times [2022-01-28 13:07:10,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:10,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434773499] [2022-01-28 13:07:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:10,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:07:10,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:10,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434773499] [2022-01-28 13:07:10,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434773499] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:10,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521020329] [2022-01-28 13:07:10,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:07:10,499 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:07:10,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:07:10,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-28 13:07:10,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:07:10,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:07:10,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-28 13:07:10,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:07:10,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:07:10,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:07:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-28 13:07:11,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521020329] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:11,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-28 13:07:11,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-28 13:07:11,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710792191] [2022-01-28 13:07:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 13:07:11,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-28 13:07:11,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-28 13:07:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-28 13:07:11,421 INFO L87 Difference]: Start difference. First operand 18721 states and 76688 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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) [2022-01-28 13:07:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:07:11,723 INFO L93 Difference]: Finished difference Result 26816 states and 110778 transitions. [2022-01-28 13:07:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 13:07:11,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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 166 [2022-01-28 13:07:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:07:11,798 INFO L225 Difference]: With dead ends: 26816 [2022-01-28 13:07:11,798 INFO L226 Difference]: Without dead ends: 23578 [2022-01-28 13:07:11,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 320 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-01-28 13:07:11,799 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 313 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 13:07:11,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 579 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 13:07:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23578 states. [2022-01-28 13:07:12,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23578 to 20340. [2022-01-28 13:07:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20340 states, 20339 states have (on average 4.105708245243129) internal successors, (83506), 20339 states have internal predecessors, (83506), 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) [2022-01-28 13:07:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20340 states to 20340 states and 83506 transitions. [2022-01-28 13:07:12,327 INFO L78 Accepts]: Start accepts. Automaton has 20340 states and 83506 transitions. Word has length 166 [2022-01-28 13:07:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:07:12,327 INFO L470 AbstractCegarLoop]: Abstraction has 20340 states and 83506 transitions. [2022-01-28 13:07:12,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 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) [2022-01-28 13:07:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 20340 states and 83506 transitions. [2022-01-28 13:07:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-28 13:07:12,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:07:12,372 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:07:12,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-28 13:07:12,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:12,588 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:07:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:07:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1267312477, now seen corresponding path program 1 times [2022-01-28 13:07:12,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:07:12,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833186859] [2022-01-28 13:07:12,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:12,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:07:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:07:13,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:07:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833186859] [2022-01-28 13:07:13,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833186859] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:07:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299078099] [2022-01-28 13:07:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:07:13,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:07:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:07:13,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:07:13,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-28 13:07:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:07:13,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-28 13:07:13,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:07:13,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:07:13,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:07:13,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:07:13,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:07:13,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-28 13:07:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:07:13,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:07:14,116 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0)))) is different from false [2022-01-28 13:07:14,159 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0)))) is different from false [2022-01-28 13:07:14,183 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-01-28 13:07:14,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_26| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1)))))) is different from false [2022-01-28 13:07:14,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_26| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))))) is different from false [2022-01-28 13:07:14,250 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:07:14,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 331 treesize of output 221 [2022-01-28 13:07:14,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 201 [2022-01-28 13:07:14,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 193 [2022-01-28 13:07:14,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2022-01-28 13:07:14,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 169 [2022-01-28 13:07:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:07:14,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299078099] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:07:14,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:07:14,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 44 [2022-01-28 13:07:14,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573614505] [2022-01-28 13:07:14,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:07:14,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-28 13:07:14,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:07:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-28 13:07:14,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1346, Unknown=5, NotChecked=390, Total=1892 [2022-01-28 13:07:14,665 INFO L87 Difference]: Start difference. First operand 20340 states and 83506 transitions. Second operand has 44 states, 44 states have (on average 6.25) internal successors, (275), 44 states have internal predecessors, (275), 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) [2022-01-28 13:07:17,074 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0) (not (= |c_thread1Thread1of1ForFork3_~#t2~0.base| c_~X_0~0.base)) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_26| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1)))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse0 (+ c_~X_0~0.offset (* c_~i_7~0 4))) c_~t_8~0) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (= c_~s_6~0 0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse0 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:07:19,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0) (not (= |c_thread1Thread1of1ForFork3_~#t2~0.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~s_6~0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_26| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_26| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_333) |v_thread1Thread1of1ForFork3_~#t3~0.base_26| v_ArrVal_334) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))))))))) is different from false [2022-01-28 13:08:31,286 WARN L227 SmtUtils]: Spent 20.04s on a formula simplification. DAG size of input: 61 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-28 13:10:41,563 WARN L227 SmtUtils]: Spent 1.20m on a formula simplification. DAG size of input: 55 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-28 13:10:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:10:59,962 INFO L93 Difference]: Finished difference Result 105560 states and 446792 transitions. [2022-01-28 13:10:59,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-28 13:10:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.25) internal successors, (275), 44 states have internal predecessors, (275), 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 170 [2022-01-28 13:10:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:11:00,905 INFO L225 Difference]: With dead ends: 105560 [2022-01-28 13:11:00,906 INFO L226 Difference]: Without dead ends: 101939 [2022-01-28 13:11:00,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 313 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 223.5s TimeCoverageRelationStatistics Valid=455, Invalid=3285, Unknown=70, NotChecked=882, Total=4692 [2022-01-28 13:11:00,907 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 1669 mSDsluCounter, 6900 mSDsCounter, 0 mSdLazyCounter, 3478 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 6152 SdHoareTripleChecker+Invalid, 7668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4127 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-28 13:11:00,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1669 Valid, 6152 Invalid, 7668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3478 Invalid, 0 Unknown, 4127 Unchecked, 1.5s Time] [2022-01-28 13:11:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101939 states. [2022-01-28 13:11:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101939 to 22360. [2022-01-28 13:11:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22360 states, 22359 states have (on average 4.132429894002415) internal successors, (92397), 22359 states have internal predecessors, (92397), 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) [2022-01-28 13:11:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22360 states to 22360 states and 92397 transitions. [2022-01-28 13:11:02,648 INFO L78 Accepts]: Start accepts. Automaton has 22360 states and 92397 transitions. Word has length 170 [2022-01-28 13:11:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:11:02,649 INFO L470 AbstractCegarLoop]: Abstraction has 22360 states and 92397 transitions. [2022-01-28 13:11:02,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.25) internal successors, (275), 44 states have internal predecessors, (275), 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) [2022-01-28 13:11:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 22360 states and 92397 transitions. [2022-01-28 13:11:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-28 13:11:02,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:11:02,902 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:11:02,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-28 13:11:03,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-28 13:11:03,103 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:11:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:11:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1562631845, now seen corresponding path program 1 times [2022-01-28 13:11:03,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:11:03,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244399755] [2022-01-28 13:11:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:11:03,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:11:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:11:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:11:03,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:11:03,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244399755] [2022-01-28 13:11:03,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244399755] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:11:03,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555530862] [2022-01-28 13:11:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:11:03,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:11:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:11:03,483 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:11:03,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-28 13:11:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:11:03,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-28 13:11:03,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:11:04,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:11:04,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:11:04,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:11:04,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:11:04,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-28 13:11:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:11:04,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:11:04,566 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_384 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-01-28 13:11:04,603 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2022-01-28 13:11:04,641 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-01-28 13:11:04,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_29| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:11:04,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_29| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:11:04,711 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:11:04,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 445 treesize of output 293 [2022-01-28 13:11:04,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 269 [2022-01-28 13:11:04,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 261 [2022-01-28 13:11:04,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 261 treesize of output 245 [2022-01-28 13:11:04,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2022-01-28 13:11:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:11:05,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555530862] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-28 13:11:05,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-28 13:11:05,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 44 [2022-01-28 13:11:05,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416205833] [2022-01-28 13:11:05,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-28 13:11:05,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-28 13:11:05,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 13:11:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-28 13:11:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1346, Unknown=5, NotChecked=390, Total=1892 [2022-01-28 13:11:05,175 INFO L87 Difference]: Start difference. First operand 22360 states and 92397 transitions. Second operand has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 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) [2022-01-28 13:11:07,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0) (not (= |c_thread1Thread1of1ForFork3_~#t2~0.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse0 (+ c_~X_0~0.offset (* c_~i_7~0 4))) c_~t_8~0) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (= c_~s_6~0 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_29| |c_#StackHeapBarrier|))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= (select .cse0 (+ c_~X_0~0.offset 4)) c_~t_8~0) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) is different from false [2022-01-28 13:11:09,715 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_29| |c_#StackHeapBarrier|))) (not (= |c_thread1Thread1of1ForFork3_~#t2~0.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~s_6~0)))) is different from false [2022-01-28 13:13:39,941 WARN L227 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 61 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-28 13:13:44,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~X_0~0.base))) (let ((.cse0 (select .cse1 (+ c_~X_0~0.offset (* c_~i_7~0 4))))) (and (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (= c_~X_0~0.offset 0) (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_29| Int)) (or (and (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_383) |v_thread1Thread1of1ForFork3_~#t3~0.base_29| v_ArrVal_384) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_29| |c_#StackHeapBarrier|))) (not (= |c_thread1Thread1of1ForFork3_~#t2~0.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (= (+ c_~X_0~0.offset (* 4 c_~i_7~0)) 4) (<= .cse0 c_~s_6~0) (<= c_~s_6~0 .cse0) (= (select .cse1 (+ c_~X_0~0.offset 4)) c_~s_6~0) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) is different from false [2022-01-28 13:14:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 13:14:04,431 INFO L93 Difference]: Finished difference Result 106344 states and 451088 transitions. [2022-01-28 13:14:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-28 13:14:04,431 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 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 170 [2022-01-28 13:14:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 13:14:04,976 INFO L225 Difference]: With dead ends: 106344 [2022-01-28 13:14:04,976 INFO L226 Difference]: Without dead ends: 103023 [2022-01-28 13:14:04,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 313 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 177.4s TimeCoverageRelationStatistics Valid=459, Invalid=3310, Unknown=45, NotChecked=1016, Total=4830 [2022-01-28 13:14:04,977 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 1619 mSDsluCounter, 8252 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 7265 SdHoareTripleChecker+Invalid, 8627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5300 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-28 13:14:04,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1619 Valid, 7265 Invalid, 8627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 3272 Invalid, 0 Unknown, 5300 Unchecked, 1.2s Time] [2022-01-28 13:14:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103023 states. [2022-01-28 13:14:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103023 to 23704. [2022-01-28 13:14:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23704 states, 23703 states have (on average 4.134708686664135) internal successors, (98005), 23703 states have internal predecessors, (98005), 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) [2022-01-28 13:14:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23704 states to 23704 states and 98005 transitions. [2022-01-28 13:14:06,767 INFO L78 Accepts]: Start accepts. Automaton has 23704 states and 98005 transitions. Word has length 170 [2022-01-28 13:14:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 13:14:06,768 INFO L470 AbstractCegarLoop]: Abstraction has 23704 states and 98005 transitions. [2022-01-28 13:14:06,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 6.090909090909091) internal successors, (268), 44 states have internal predecessors, (268), 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) [2022-01-28 13:14:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23704 states and 98005 transitions. [2022-01-28 13:14:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-28 13:14:07,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 13:14:07,040 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 13:14:07,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-28 13:14:07,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:14:07,248 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATION, thread1Err5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-28 13:14:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 13:14:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1061992675, now seen corresponding path program 2 times [2022-01-28 13:14:07,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 13:14:07,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290220551] [2022-01-28 13:14:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 13:14:07,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 13:14:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 13:14:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-28 13:14:07,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 13:14:07,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290220551] [2022-01-28 13:14:07,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290220551] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-28 13:14:07,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167124110] [2022-01-28 13:14:07,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-28 13:14:07,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:14:07,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 13:14:07,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-28 13:14:07,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-28 13:14:07,753 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-28 13:14:07,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-28 13:14:07,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-28 13:14:07,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-28 13:14:07,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:14:07,984 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-28 13:14:07,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-28 13:14:08,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-28 13:14:08,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:14:08,482 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-28 13:14:08,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:14:08,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-28 13:14:08,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:14:08,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-28 13:14:08,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-28 13:14:08,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-28 13:14:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 13:14:09,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-28 13:14:09,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0))) (forall ((v_ArrVal_440 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4)) c_~s_2~0) (+ c_~s_6~0 1)))) is different from false [2022-01-28 13:14:09,444 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_3~0 4) 4))) (+ c_~s_6~0 1)))) is different from false [2022-01-28 13:14:09,462 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) is different from false [2022-01-28 13:14:09,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_32| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:14:09,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_32| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:14:09,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4)) 1))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (<= (+ c_~s_6~0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset (* c_~i_7~0 4) 4))) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) (+ c_~X_0~0.offset 4))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_32| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:14:09,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (+ c_~X_0~0.offset 4))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse0) (+ (select (select |c_#memory_int| c_~X_0~0.base) .cse0) 1)))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (+ c_~X_0~0.offset 4))) (<= (select (select |c_#memory_int| c_~X_0~0.base) .cse1) (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1))))) (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_32| |c_#StackHeapBarrier|))) is different from false [2022-01-28 13:14:09,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork3_~#t3~0.base_32| Int)) (or (<= |v_thread1Thread1of1ForFork3_~#t3~0.base_32| |c_#StackHeapBarrier|) (and (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse1 (+ c_~X_0~0.offset 4))) (< (select (select (store (store .cse0 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))) (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_438)) (.cse3 (+ c_~X_0~0.offset 4))) (<= (select (select .cse2 c_~X_0~0.base) .cse3) (select (select (store (store .cse2 |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_439) |v_thread1Thread1of1ForFork3_~#t3~0.base_32| v_ArrVal_440) c_~X_0~0.base) .cse3))))))) is different from false [2022-01-28 13:14:20,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:14:20,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-01-28 13:14:20,457 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-28 13:14:20,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13306 treesize of output 12232 [2022-01-28 13:14:20,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11941 treesize of output 11685 [2022-01-28 13:14:20,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11685 treesize of output 11557 [2022-01-28 13:14:21,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11557 treesize of output 10533 [2022-01-28 13:14:21,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10533 treesize of output 10021 [2022-01-28 13:14:21,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10021 treesize of output 9445 [2022-01-28 13:14:21,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9445 treesize of output 9301 [2022-01-28 13:14:21,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9301 treesize of output 8277 [2022-01-28 13:14:21,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8277 treesize of output 8021 [2022-01-28 13:14:21,317 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-28 13:14:21,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-28 13:14:21,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-28 13:14:21,518 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-28 13:14:21,521 INFO L158 Benchmark]: Toolchain (without parser) took 452139.82ms. Allocated memory was 190.8MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 140.7MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-01-28 13:14:21,521 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 13:14:21,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.27ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 165.6MB in the end (delta: -25.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-01-28 13:14:21,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 163.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 13:14:21,522 INFO L158 Benchmark]: Boogie Preprocessor took 44.39ms. Allocated memory is still 190.8MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 13:14:21,522 INFO L158 Benchmark]: RCFGBuilder took 562.80ms. Allocated memory is still 190.8MB. Free memory was 161.0MB in the beginning and 128.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-01-28 13:14:21,522 INFO L158 Benchmark]: TraceAbstraction took 451278.63ms. Allocated memory was 190.8MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 128.0MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-01-28 13:14:21,524 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.11ms. Allocated memory is still 190.8MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 198.27ms. Allocated memory is still 190.8MB. Free memory was 140.6MB in the beginning and 165.6MB in the end (delta: -25.0MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 190.8MB. Free memory was 165.6MB in the beginning and 163.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.39ms. Allocated memory is still 190.8MB. Free memory was 163.1MB in the beginning and 161.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.80ms. Allocated memory is still 190.8MB. Free memory was 161.0MB in the beginning and 128.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 451278.63ms. Allocated memory was 190.8MB in the beginning and 6.7GB in the end (delta: 6.5GB). Free memory was 128.0MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-28 13:14:21,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...