/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:20:22,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:20:22,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:20:22,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:20:22,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:20:22,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:20:22,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:20:22,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:20:22,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:20:22,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:20:22,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:20:22,880 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:20:22,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:20:22,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:20:22,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:20:22,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:20:22,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:20:22,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:20:22,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:20:22,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:20:22,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:20:22,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:20:22,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:20:22,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:20:22,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:20:22,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:20:22,890 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:20:22,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:20:22,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:20:22,891 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:20:22,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:20:22,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:20:22,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:20:22,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:20:22,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:20:22,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:20:22,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:20:22,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:20:22,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:20:22,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:20:22,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:20:22,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:20:22,913 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:20:22,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:20:22,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:20:22,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:20:22,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:20:22,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:20:22,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:20:22,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:20:22,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:20:22,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:20:22,917 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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-03-15 19:20:23,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:20:23,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:20:23,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:20:23,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:20:23,129 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:20:23,129 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-03-15 19:20:23,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c311b96e6/cbcb70d6183a4a7ab1b62d76bd63cbd0/FLAG843d3da03 [2022-03-15 19:20:23,488 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:20:23,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-03-15 19:20:23,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c311b96e6/cbcb70d6183a4a7ab1b62d76bd63cbd0/FLAG843d3da03 [2022-03-15 19:20:23,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c311b96e6/cbcb70d6183a4a7ab1b62d76bd63cbd0 [2022-03-15 19:20:23,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:20:23,900 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:20:23,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:20:23,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:20:23,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:20:23,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:20:23" (1/1) ... [2022-03-15 19:20:23,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebdefc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:23, skipping insertion in model container [2022-03-15 19:20:23,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:20:23" (1/1) ... [2022-03-15 19:20:23,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:20:23,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:20:24,122 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/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-03-15 19:20:24,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:20:24,146 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:20:24,173 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/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-03-15 19:20:24,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:20:24,192 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:20:24,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24 WrapperNode [2022-03-15 19:20:24,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:20:24,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:20:24,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:20:24,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:20:24,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,239 INFO L137 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-03-15 19:20:24,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:20:24,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:20:24,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:20:24,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:20:24,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:20:24,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:20:24,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:20:24,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:20:24,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (1/1) ... [2022-03-15 19:20:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:20:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:24,317 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-03-15 19:20:24,331 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-03-15 19:20:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:20:24,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:20:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:20:24,354 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:20:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:20:24,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:20:24,357 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:20:24,456 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:20:24,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:20:24,707 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:20:24,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:20:24,872 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-15 19:20:24,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:20:24 BoogieIcfgContainer [2022-03-15 19:20:24,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:20:24,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:20:24,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:20:24,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:20:24,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:20:23" (1/3) ... [2022-03-15 19:20:24,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba87245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:20:24, skipping insertion in model container [2022-03-15 19:20:24,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:20:24" (2/3) ... [2022-03-15 19:20:24,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba87245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:20:24, skipping insertion in model container [2022-03-15 19:20:24,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:20:24" (3/3) ... [2022-03-15 19:20:24,887 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-03-15 19:20:24,891 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:20:24,891 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:20:24,892 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:20:24,892 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:20:24,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,945 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,946 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,947 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,952 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,953 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,954 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,957 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,958 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,959 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,960 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,961 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,962 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,969 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,970 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,971 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,972 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,973 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,974 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,977 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,977 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,978 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,979 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,979 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,980 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,981 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,982 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:20:24,984 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:20:25,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:20:25,022 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:20:25,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:20:25,037 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:20:25,044 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 153 transitions, 330 flow [2022-03-15 19:20:25,049 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 153 transitions, 330 flow [2022-03-15 19:20:25,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-03-15 19:20:25,122 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-03-15 19:20:25,122 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:20:25,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-03-15 19:20:25,128 INFO L116 LiptonReduction]: Number of co-enabled transitions 1320 [2022-03-15 19:20:29,347 INFO L131 LiptonReduction]: Checked pairs total: 1666 [2022-03-15 19:20:29,347 INFO L133 LiptonReduction]: Total number of compositions: 149 [2022-03-15 19:20:29,360 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-03-15 19:20:29,389 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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-03-15 19:20:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 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-03-15 19:20:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:20:29,396 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:29,396 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] [2022-03-15 19:20:29,396 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1406685170, now seen corresponding path program 1 times [2022-03-15 19:20:29,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:29,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479308074] [2022-03-15 19:20:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:29,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:29,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:29,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479308074] [2022-03-15 19:20:29,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479308074] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:29,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:29,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:20:29,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445264782] [2022-03-15 19:20:29,694 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:29,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:29,730 INFO L252 McrAutomatonBuilder]: Finished intersection with 107 states and 244 transitions. [2022-03-15 19:20:29,730 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:30,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:30,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:20:30,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:30,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:20:30,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:20:30,407 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-03-15 19:20:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:30,450 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-03-15 19:20:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:20:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2022-03-15 19:20:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:30,460 INFO L225 Difference]: With dead ends: 204 [2022-03-15 19:20:30,460 INFO L226 Difference]: Without dead ends: 197 [2022-03-15 19:20:30,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:20:30,463 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:30,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:20:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-03-15 19:20:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-03-15 19:20:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 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-03-15 19:20:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-03-15 19:20:30,514 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-03-15 19:20:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:30,514 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-03-15 19:20:30,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-03-15 19:20:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-03-15 19:20:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:20:30,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:30,520 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] [2022-03-15 19:20:30,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:20:30,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 686739784, now seen corresponding path program 1 times [2022-03-15 19:20:30,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:30,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821093622] [2022-03-15 19:20:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:30,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:30,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821093622] [2022-03-15 19:20:30,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821093622] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:30,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:30,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:20:30,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804661725] [2022-03-15 19:20:30,648 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:30,650 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:30,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 133 states and 315 transitions. [2022-03-15 19:20:30,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:31,564 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [974#(< |thread3Thread1of1ForFork1_~i~2#1| ~N~0), 977#(<= ~N~0 ~M~0), 975#(or (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 976#(or (< (+ ~M~0 1) ~N~0) (<= ~N~0 ~M~0))] [2022-03-15 19:20:31,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:20:31,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:20:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:20:31,565 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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-03-15 19:20:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:31,720 INFO L93 Difference]: Finished difference Result 389 states and 1163 transitions. [2022-03-15 19:20:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:20:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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 21 [2022-03-15 19:20:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:31,722 INFO L225 Difference]: With dead ends: 389 [2022-03-15 19:20:31,722 INFO L226 Difference]: Without dead ends: 375 [2022-03-15 19:20:31,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:20:31,723 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 84 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:31,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 22 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-03-15 19:20:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 329. [2022-03-15 19:20:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.125) internal successors, (1025), 328 states have internal predecessors, (1025), 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-03-15 19:20:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1025 transitions. [2022-03-15 19:20:31,735 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1025 transitions. Word has length 21 [2022-03-15 19:20:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:31,735 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 1025 transitions. [2022-03-15 19:20:31,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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-03-15 19:20:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1025 transitions. [2022-03-15 19:20:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:20:31,736 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:31,736 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] [2022-03-15 19:20:31,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:20:31,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1998618933, now seen corresponding path program 1 times [2022-03-15 19:20:31,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:31,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159479913] [2022-03-15 19:20:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:31,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:31,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159479913] [2022-03-15 19:20:31,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159479913] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:31,774 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:31,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:20:31,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859246070] [2022-03-15 19:20:31,774 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:31,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:31,800 INFO L252 McrAutomatonBuilder]: Finished intersection with 89 states and 187 transitions. [2022-03-15 19:20:31,800 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:32,177 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2034#(< |thread1Thread1of1ForFork2_~i~0#1| ~N~0)] [2022-03-15 19:20:32,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:20:32,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:32,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:20:32,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:20:32,179 INFO L87 Difference]: Start difference. First operand 329 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-03-15 19:20:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:32,246 INFO L93 Difference]: Finished difference Result 349 states and 1013 transitions. [2022-03-15 19:20:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:20:32,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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 21 [2022-03-15 19:20:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:32,248 INFO L225 Difference]: With dead ends: 349 [2022-03-15 19:20:32,248 INFO L226 Difference]: Without dead ends: 333 [2022-03-15 19:20:32,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:20:32,249 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:32,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 17 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-03-15 19:20:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 313. [2022-03-15 19:20:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 3.0096153846153846) internal successors, (939), 312 states have internal predecessors, (939), 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-03-15 19:20:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 939 transitions. [2022-03-15 19:20:32,256 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 939 transitions. Word has length 21 [2022-03-15 19:20:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:32,256 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 939 transitions. [2022-03-15 19:20:32,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 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-03-15 19:20:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 939 transitions. [2022-03-15 19:20:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:20:32,257 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:32,257 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] [2022-03-15 19:20:32,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:20:32,258 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1832672441, now seen corresponding path program 1 times [2022-03-15 19:20:32,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:32,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791768362] [2022-03-15 19:20:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:32,353 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:32,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791768362] [2022-03-15 19:20:32,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791768362] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:20:32,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:20:32,354 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:20:32,354 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431378233] [2022-03-15 19:20:32,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:32,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:32,366 INFO L252 McrAutomatonBuilder]: Finished intersection with 83 states and 171 transitions. [2022-03-15 19:20:32,366 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:32,635 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3019#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)] [2022-03-15 19:20:32,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:20:32,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:20:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:20:32,636 INFO L87 Difference]: Start difference. First operand 313 states and 939 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-03-15 19:20:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:32,749 INFO L93 Difference]: Finished difference Result 265 states and 763 transitions. [2022-03-15 19:20:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:20:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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 21 [2022-03-15 19:20:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:32,750 INFO L225 Difference]: With dead ends: 265 [2022-03-15 19:20:32,750 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:20:32,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:20:32,751 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:32,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 10 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:20:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:20:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-03-15 19:20:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 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-03-15 19:20:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-03-15 19:20:32,755 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-03-15 19:20:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:32,755 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-03-15 19:20:32,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 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-03-15 19:20:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-03-15 19:20:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:20:32,756 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:32,756 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] [2022-03-15 19:20:32,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 19:20:32,756 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1648037676, now seen corresponding path program 1 times [2022-03-15 19:20:32,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:32,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182001449] [2022-03-15 19:20:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:32,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:32,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182001449] [2022-03-15 19:20:32,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182001449] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:32,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172196694] [2022-03-15 19:20:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:32,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:32,794 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-03-15 19:20:32,816 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-03-15 19:20:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:32,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:20:32,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:32,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:32,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172196694] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:32,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:20:32,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 19:20:32,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307313728] [2022-03-15 19:20:32,998 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:33,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:33,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 316 transitions. [2022-03-15 19:20:33,049 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:33,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:20:33,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:20:33,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:33,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:20:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:20:33,651 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-03-15 19:20:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:33,692 INFO L93 Difference]: Finished difference Result 174 states and 549 transitions. [2022-03-15 19:20:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:20:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:20:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:33,693 INFO L225 Difference]: With dead ends: 174 [2022-03-15 19:20:33,694 INFO L226 Difference]: Without dead ends: 174 [2022-03-15 19:20:33,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:20:33,694 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:33,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:20:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-15 19:20:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2022-03-15 19:20:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 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-03-15 19:20:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-03-15 19:20:33,698 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2022-03-15 19:20:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:33,698 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-03-15 19:20:33,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 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-03-15 19:20:33,698 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-03-15 19:20:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:20:33,699 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:33,699 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] [2022-03-15 19:20:33,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:20:33,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:33,916 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash -38429097, now seen corresponding path program 1 times [2022-03-15 19:20:33,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:33,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251024977] [2022-03-15 19:20:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:33,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:33,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251024977] [2022-03-15 19:20:33,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251024977] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:33,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655992561] [2022-03-15 19:20:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:33,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:33,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:33,966 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-03-15 19:20:33,991 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-03-15 19:20:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:34,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:20:34,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:34,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:34,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655992561] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:34,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:20:34,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-03-15 19:20:34,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369098003] [2022-03-15 19:20:34,179 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:34,182 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:34,193 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2022-03-15 19:20:34,193 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:34,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4406#(or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 4405#(< 0 ~M~0), 4407#(or (<= (+ ~M~0 1) ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0)), 4403#(< |thread2Thread1of1ForFork0_~i~1#1| ~M~0), 4408#(or (< 0 ~M~0) (< ~M~0 ~N~0)), 4404#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))] [2022-03-15 19:20:34,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:20:34,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:20:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:20:34,849 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 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-03-15 19:20:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:35,199 INFO L93 Difference]: Finished difference Result 316 states and 999 transitions. [2022-03-15 19:20:35,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:20:35,200 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:20:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:35,201 INFO L225 Difference]: With dead ends: 316 [2022-03-15 19:20:35,201 INFO L226 Difference]: Without dead ends: 316 [2022-03-15 19:20:35,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:20:35,202 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 86 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:35,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 50 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:20:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-03-15 19:20:35,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 224. [2022-03-15 19:20:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.1704035874439462) internal successors, (707), 223 states have internal predecessors, (707), 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-03-15 19:20:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 707 transitions. [2022-03-15 19:20:35,208 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 707 transitions. Word has length 22 [2022-03-15 19:20:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:35,208 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 707 transitions. [2022-03-15 19:20:35,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 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-03-15 19:20:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 707 transitions. [2022-03-15 19:20:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:20:35,209 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:35,209 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] [2022-03-15 19:20:35,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:35,425 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,SelfDestructingSolverStorable5 [2022-03-15 19:20:35,426 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1162129533, now seen corresponding path program 1 times [2022-03-15 19:20:35,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:35,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660690704] [2022-03-15 19:20:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:35,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:35,698 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:35,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660690704] [2022-03-15 19:20:35,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660690704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:35,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194091413] [2022-03-15 19:20:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:35,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:35,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:35,700 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-03-15 19:20:35,701 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-03-15 19:20:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:35,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjunts are in the unsatisfiable core [2022-03-15 19:20:35,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:35,828 INFO L387 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 11 treesize of output 7 [2022-03-15 19:20:35,860 INFO L387 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-03-15 19:20:35,905 INFO L387 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-03-15 19:20:36,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:20:36,070 INFO L387 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 14 treesize of output 16 [2022-03-15 19:20:36,209 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:36,209 INFO L387 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 19 treesize of output 19 [2022-03-15 19:20:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:36,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:36,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))) c_~res1~0) (not (<= |v_thread3Thread1of1ForFork1_~i~2#1_251| c_~M~0)))) is different from false [2022-03-15 19:20:36,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (not (<= |v_thread3Thread1of1ForFork1_~i~2#1_251| c_~M~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-15 19:20:36,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (not (<= |v_thread3Thread1of1ForFork1_~i~2#1_251| c_~M~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 19:20:36,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (< |c_thread2Thread1of1ForFork0_~i~1#1| |v_thread3Thread1of1ForFork1_~i~2#1_251|) (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 19:20:36,445 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork1_~i~2#1_251|) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-15 19:20:36,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216))) (= (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (+ c_~res2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4)))))) (< 0 |v_thread3Thread1of1ForFork1_~i~2#1_251|))) is different from false [2022-03-15 19:20:36,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (|v_thread3Thread1of1ForFork1_~i~2#1_251| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork1_~i~2#1_251|) c_~N~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_215) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_216))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork1_~i~2#1_251| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (< 0 |v_thread3Thread1of1ForFork1_~i~2#1_251|))) is different from false [2022-03-15 19:20:36,512 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:36,512 INFO L387 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 58 treesize of output 47 [2022-03-15 19:20:36,523 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:36,523 INFO L387 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 3286 treesize of output 3042 [2022-03-15 19:20:36,539 INFO L387 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 3030 treesize of output 2646 [2022-03-15 19:20:36,558 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:36,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2646 treesize of output 2338 [2022-03-15 19:20:36,578 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:36,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2326 treesize of output 2178 [2022-03-15 19:20:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:20:37,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194091413] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:37,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:37,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2022-03-15 19:20:37,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492912914] [2022-03-15 19:20:37,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:37,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:37,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 240 transitions. [2022-03-15 19:20:37,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:40,744 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [5353#(and (= ~A~0.offset 0) (or (<= 0 ~M~0) (<= (+ 2 ~M~0) ~N~0)) (or (<= ~N~0 1) (<= (+ 2 ~M~0) ~N~0)) (= ~res2~0 0) (or (<= (+ 2 ~M~0) ~N~0) (not (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res1~0))), 5351#(or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0 2147483648))) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) 2147483647))), 5357#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= ~N~0 1) (<= (+ 2 ~M~0) ~N~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 ~M~0) ~N~0) (not (<= (+ ~A~0.offset (* ~M~0 4)) 0)) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res1~0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 0 ~M~0) (<= (+ 2 ~M~0) ~N~0))), 5352#(or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))), 5355#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 5356#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (<= 0 |thread3Thread1of1ForFork1_~i~2#1|)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res1~0) (not (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0)))), 5354#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), 5358#(and (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (<= ~N~0 1)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= 1 ~N~0) (not (<= (+ ~M~0 1) 0))) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~A~0.offset 0)) (or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (<= (+ ~M~0 1) 0) (= ~res1~0 (select (select |#memory_int| ~A~0.base) 0))))] [2022-03-15 19:20:40,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:20:40,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:40,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:20:40,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=912, Unknown=7, NotChecked=476, Total=1560 [2022-03-15 19:20:40,746 INFO L87 Difference]: Start difference. First operand 224 states and 707 transitions. Second operand has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-03-15 19:20:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:41,577 INFO L93 Difference]: Finished difference Result 477 states and 1496 transitions. [2022-03-15 19:20:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:20:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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 23 [2022-03-15 19:20:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:41,580 INFO L225 Difference]: With dead ends: 477 [2022-03-15 19:20:41,580 INFO L226 Difference]: Without dead ends: 470 [2022-03-15 19:20:41,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 66 SyntacticMatches, 33 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=256, Invalid=1487, Unknown=7, NotChecked=602, Total=2352 [2022-03-15 19:20:41,581 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 153 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:41,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 64 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:20:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-03-15 19:20:41,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 330. [2022-03-15 19:20:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 3.2674772036474162) internal successors, (1075), 329 states have internal predecessors, (1075), 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-03-15 19:20:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1075 transitions. [2022-03-15 19:20:41,589 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 1075 transitions. Word has length 23 [2022-03-15 19:20:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:41,589 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 1075 transitions. [2022-03-15 19:20:41,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 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-03-15 19:20:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 1075 transitions. [2022-03-15 19:20:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:20:41,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:41,590 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] [2022-03-15 19:20:41,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:20:41,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:41,827 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1350530101, now seen corresponding path program 2 times [2022-03-15 19:20:41,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:41,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234621780] [2022-03-15 19:20:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:42,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:42,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234621780] [2022-03-15 19:20:42,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234621780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:42,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215120898] [2022-03-15 19:20:42,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:20:42,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:42,053 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-03-15 19:20:42,054 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-03-15 19:20:42,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:20:42,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:20:42,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-15 19:20:42,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:42,339 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:42,339 INFO L387 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 17 treesize of output 17 [2022-03-15 19:20:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:42,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:42,451 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:20:42,452 INFO L387 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 23 treesize of output 24 [2022-03-15 19:20:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:42,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215120898] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:42,688 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:42,688 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 21 [2022-03-15 19:20:42,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840024319] [2022-03-15 19:20:42,689 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:42,692 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:42,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 156 states and 382 transitions. [2022-03-15 19:20:42,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:20:48,154 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 39 new interpolants: [6697#(or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< 0 ~M~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (not (< 0 ~N~0))), 6686#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< 0 ~M~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 6671#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0)), 6701#(and (= ~A~0.offset 0) (= ~res1~0 0) (or (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~res2~0 0) (<= ~M~0 0)), 6681#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 ~res1~0) (< 0 ~M~0)), 6692#(and (= ~A~0.offset 0) (= ~res1~0 0) (or (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1) (* ~N~0 4)))), 6685#(or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (< 0 ~M~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0 2147483648))) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) 2147483647))), 6707#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0))), 6698#(and (or (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 0 ~M~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1) (* ~N~0 4))) (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~res1~0 0))), 6676#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0)), 6689#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0))), 6673#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~N~0 |thread3Thread1of1ForFork1_~i~2#1|) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0)) (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0)) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0 2147483648) 0)), 6670#(or (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648))) (<= (+ 2 ~M~0) ~N~0) (not (< ~M~0 ~N~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) 2147483647))), 6684#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~res1~0 0)) (or (< 0 ~M~0) (= ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1) (* ~N~0 4)))), 6691#(or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (not (< 0 ~N~0))), 6669#(or (not (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)) (<= (+ 2 |thread3Thread1of1ForFork1_~i~2#1|) ~N~0) (not (<= 0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0 2147483648))) (= ~res1~0 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0)) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|))) ~res2~0) 2147483647))), 6674#(or (< 2147483647 (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0 2147483648) 0) (= (+ (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) ~res2~0) ~res1~0) (<= ~N~0 ~M~0) (<= (+ 2 ~M~0) ~N~0)), 6677#(or (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2147483648))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) ~res2~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))), 6683#(or (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)), 6696#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0))), 6680#(or (= ~res2~0 ~res1~0) (< 0 ~M~0)), 6706#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0))), 6678#(or (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2147483648))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) ~res2~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))), 6704#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0))), 6694#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1) (* ~N~0 4))) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0))), 6682#(or (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2147483648))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) ~res2~0) (< 0 ~M~0) (not (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0))), 6699#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0)) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 6688#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (or (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (= ~res2~0 0) (<= ~M~0 0)), 6705#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0))), 6672#(or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 ~res1~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0)), 6687#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 6690#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0))), 6702#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= ~M~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0))), 6675#(or (< |thread1Thread1of1ForFork2_~i~0#1| ~N~0) (= ~res2~0 ~res1~0)), 6693#(or (not (<= 0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (not (<= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 1 ~N~0) (not (< 0 ~N~0))), 6700#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0)) (or (< 0 ~M~0) (<= |thread3Thread1of1ForFork1_~i~2#1| 0)) (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (< 0 ~M~0) (<= 1 ~N~0))), 6679#(and (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~A~0.offset 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res1~0 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= |thread1Thread1of1ForFork2_~i~0#1| 0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (= ~res2~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) (<= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|) 1) (* ~N~0 4)))), 6703#(and (or (= ~A~0.offset 0) (< 0 ~M~0)) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 ~M~0)) (or (< 0 ~M~0) (<= 1 ~N~0) (= (+ ~A~0.offset (* ~M~0 4)) 0)) (or (< 0 ~M~0) (= ~res2~0 0)) (or (< 0 ~M~0) (= ~res1~0 0))), 6695#(and (= ~A~0.offset 0) (= ~res1~0 0) (or (= (+ ~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) 0) (<= 1 ~N~0)) (<= |thread3Thread1of1ForFork1_~i~2#1| 0) (= ~res2~0 0))] [2022-03-15 19:20:48,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:20:48,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:20:48,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:20:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=3368, Unknown=0, NotChecked=0, Total=3782 [2022-03-15 19:20:48,156 INFO L87 Difference]: Start difference. First operand 330 states and 1075 transitions. Second operand has 51 states, 50 states have (on average 4.16) internal successors, (208), 50 states have internal predecessors, (208), 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-03-15 19:20:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:20:58,849 INFO L93 Difference]: Finished difference Result 1605 states and 4937 transitions. [2022-03-15 19:20:58,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 19:20:58,849 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 4.16) internal successors, (208), 50 states have internal predecessors, (208), 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 23 [2022-03-15 19:20:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:20:58,856 INFO L225 Difference]: With dead ends: 1605 [2022-03-15 19:20:58,856 INFO L226 Difference]: Without dead ends: 1570 [2022-03-15 19:20:58,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9491 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3044, Invalid=25686, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 19:20:58,862 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 466 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 6649 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 6766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 6649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:20:58,863 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 395 Invalid, 6766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 6649 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 19:20:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-03-15 19:20:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 348. [2022-03-15 19:20:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.270893371757925) internal successors, (1135), 347 states have internal predecessors, (1135), 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-03-15 19:20:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1135 transitions. [2022-03-15 19:20:58,901 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1135 transitions. Word has length 23 [2022-03-15 19:20:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:20:58,901 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 1135 transitions. [2022-03-15 19:20:58,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 4.16) internal successors, (208), 50 states have internal predecessors, (208), 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-03-15 19:20:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1135 transitions. [2022-03-15 19:20:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:20:58,902 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:20:58,902 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] [2022-03-15 19:20:58,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:20:59,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:59,124 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:20:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:20:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1056438428, now seen corresponding path program 1 times [2022-03-15 19:20:59,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:20:59,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477316754] [2022-03-15 19:20:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:20:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:59,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:20:59,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477316754] [2022-03-15 19:20:59,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477316754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:20:59,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636211912] [2022-03-15 19:20:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:20:59,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:20:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:20:59,284 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-03-15 19:20:59,337 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-03-15 19:20:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:20:59,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 56 conjunts are in the unsatisfiable core [2022-03-15 19:20:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:20:59,420 INFO L387 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 11 treesize of output 7 [2022-03-15 19:20:59,443 INFO L387 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-03-15 19:20:59,468 INFO L387 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-03-15 19:20:59,507 INFO L387 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 11 [2022-03-15 19:20:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:20:59,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:20:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:20:59,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636211912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:20:59,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:20:59,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 4] total 12 [2022-03-15 19:20:59,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1285302247] [2022-03-15 19:20:59,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:20:59,580 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:20:59,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 140 transitions. [2022-03-15 19:20:59,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:00,116 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [9374#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0)), 9371#(and (= ~A~0.offset 0) (= ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~res2~0 0)), 9373#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) ~res2~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2147483648) 0)), 9372#(and (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= ~res2~0 0))] [2022-03-15 19:21:00,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:21:00,117 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:21:00,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:21:00,117 INFO L87 Difference]: Start difference. First operand 348 states and 1135 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-03-15 19:21:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:00,387 INFO L93 Difference]: Finished difference Result 535 states and 1719 transitions. [2022-03-15 19:21:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:21:00,387 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 23 [2022-03-15 19:21:00,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:00,390 INFO L225 Difference]: With dead ends: 535 [2022-03-15 19:21:00,390 INFO L226 Difference]: Without dead ends: 528 [2022-03-15 19:21:00,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:21:00,391 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 73 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:00,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 62 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:21:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-03-15 19:21:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 394. [2022-03-15 19:21:00,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.3053435114503817) internal successors, (1299), 393 states have internal predecessors, (1299), 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-03-15 19:21:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1299 transitions. [2022-03-15 19:21:00,400 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1299 transitions. Word has length 23 [2022-03-15 19:21:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:00,400 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 1299 transitions. [2022-03-15 19:21:00,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-03-15 19:21:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1299 transitions. [2022-03-15 19:21:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:21:00,401 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:00,401 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] [2022-03-15 19:21:00,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:21:00,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:00,619 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1169299296, now seen corresponding path program 2 times [2022-03-15 19:21:00,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:00,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778720474] [2022-03-15 19:21:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:00,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:00,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778720474] [2022-03-15 19:21:00,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778720474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:00,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433233037] [2022-03-15 19:21:00,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:21:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:00,795 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-03-15 19:21:00,796 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-03-15 19:21:00,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:21:00,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:00,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:21:00,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:01,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:01,039 INFO L387 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 14 treesize of output 16 [2022-03-15 19:21:01,098 INFO L387 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 11 [2022-03-15 19:21:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:01,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:01,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_354) c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4)))) c_~res1~0)) is different from false [2022-03-15 19:21:01,148 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:01,148 INFO L387 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 54 treesize of output 46 [2022-03-15 19:21:01,151 INFO L387 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 17 treesize of output 11 [2022-03-15 19:21:01,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-15 19:21:01,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433233037] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:01,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:01,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-03-15 19:21:01,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [851982363] [2022-03-15 19:21:01,279 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:01,281 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:01,297 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 232 transitions. [2022-03-15 19:21:01,297 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:02,342 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10860#(and (= ~A~0.offset 0) (= ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~res2~0 0)), 10861#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= ~res2~0 0))] [2022-03-15 19:21:02,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:21:02,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:21:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=328, Unknown=1, NotChecked=38, Total=462 [2022-03-15 19:21:02,343 INFO L87 Difference]: Start difference. First operand 394 states and 1299 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-03-15 19:21:02,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:02,529 INFO L93 Difference]: Finished difference Result 605 states and 1961 transitions. [2022-03-15 19:21:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:21:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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 23 [2022-03-15 19:21:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:02,532 INFO L225 Difference]: With dead ends: 605 [2022-03-15 19:21:02,532 INFO L226 Difference]: Without dead ends: 598 [2022-03-15 19:21:02,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=471, Unknown=1, NotChecked=46, Total=650 [2022-03-15 19:21:02,533 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:02,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 40 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:21:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-03-15 19:21:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 412. [2022-03-15 19:21:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 3.3600973236009732) internal successors, (1381), 411 states have internal predecessors, (1381), 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-03-15 19:21:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1381 transitions. [2022-03-15 19:21:02,542 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1381 transitions. Word has length 23 [2022-03-15 19:21:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:02,542 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 1381 transitions. [2022-03-15 19:21:02,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-03-15 19:21:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1381 transitions. [2022-03-15 19:21:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:21:02,543 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:02,543 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] [2022-03-15 19:21:02,564 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-03-15 19:21:02,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:02,757 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 845702530, now seen corresponding path program 3 times [2022-03-15 19:21:02,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:02,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709813408] [2022-03-15 19:21:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:21:02,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:02,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709813408] [2022-03-15 19:21:02,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709813408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:02,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591461316] [2022-03-15 19:21:02,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:21:02,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:02,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:02,918 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-03-15 19:21:02,919 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-03-15 19:21:02,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:21:02,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:03,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:21:03,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:03,036 INFO L387 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 11 treesize of output 7 [2022-03-15 19:21:03,099 INFO L387 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-03-15 19:21:03,139 INFO L387 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-03-15 19:21:03,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:03,260 INFO L387 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 18 treesize of output 20 [2022-03-15 19:21:03,273 INFO L387 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 15 treesize of output 7 [2022-03-15 19:21:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:03,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:03,322 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) c_~res2~0)) is different from false [2022-03-15 19:21:03,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~res2~0) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))))) is different from false [2022-03-15 19:21:03,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~res2~0) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~A~0.base) c_~A~0.offset) c_~res1~0))) is different from false [2022-03-15 19:21:03,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res2~0))) is different from false [2022-03-15 19:21:03,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402))) (= (+ c_~res1~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) c_~A~0.base) c_~A~0.offset)) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res2~0)))) is different from false [2022-03-15 19:21:03,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_401 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_402))) (= (+ c_~res1~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_403) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-03-15 19:21:03,365 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:03,366 INFO L387 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 54 treesize of output 43 [2022-03-15 19:21:03,369 INFO L387 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 1382 treesize of output 1286 [2022-03-15 19:21:03,375 INFO L387 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 1286 treesize of output 1238 [2022-03-15 19:21:03,380 INFO L387 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 1238 treesize of output 1174 [2022-03-15 19:21:03,385 INFO L387 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 1174 treesize of output 1078 [2022-03-15 19:21:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:21:08,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591461316] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:21:08,494 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:21:08,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2022-03-15 19:21:08,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [272273231] [2022-03-15 19:21:08,495 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:21:08,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:21:08,509 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 196 transitions. [2022-03-15 19:21:08,509 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:21:09,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [12455#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)))) (= (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset))) ~res2~0) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork2_~i~0#1| 4) ~A~0.offset)) 2147483648) 0)), 12457#(and (= ~res2~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (= ~A~0.offset 0) (= ~res1~0 0)), 12458#(and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= ~A~0.offset 0) (= |thread1Thread1of1ForFork2_~i~0#1| 0) (= ~res1~0 0) (= ~res2~0 0)), 12456#(or (< 2147483647 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (= ~res2~0 (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~res1~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0))] [2022-03-15 19:21:09,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:21:09,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:21:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:21:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2022-03-15 19:21:09,514 INFO L87 Difference]: Start difference. First operand 412 states and 1381 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-03-15 19:21:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:21:09,734 INFO L93 Difference]: Finished difference Result 549 states and 1823 transitions. [2022-03-15 19:21:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:21:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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 23 [2022-03-15 19:21:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:21:09,737 INFO L225 Difference]: With dead ends: 549 [2022-03-15 19:21:09,737 INFO L226 Difference]: Without dead ends: 542 [2022-03-15 19:21:09,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=529, Unknown=6, NotChecked=318, Total=992 [2022-03-15 19:21:09,738 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:21:09,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:21:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-03-15 19:21:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 414. [2022-03-15 19:21:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 3.358353510895884) internal successors, (1387), 413 states have internal predecessors, (1387), 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-03-15 19:21:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1387 transitions. [2022-03-15 19:21:09,747 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1387 transitions. Word has length 23 [2022-03-15 19:21:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:21:09,747 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 1387 transitions. [2022-03-15 19:21:09,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-03-15 19:21:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1387 transitions. [2022-03-15 19:21:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:21:09,748 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:21:09,748 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] [2022-03-15 19:21:09,765 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-03-15 19:21:09,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:09,962 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:21:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:21:09,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1793978216, now seen corresponding path program 4 times [2022-03-15 19:21:09,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:21:09,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735818879] [2022-03-15 19:21:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:21:09,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:21:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:10,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:21:10,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735818879] [2022-03-15 19:21:10,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735818879] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:21:10,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505740615] [2022-03-15 19:21:10,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:21:10,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:21:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:21:10,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:21:10,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:21:10,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:21:10,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:21:10,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:21:10,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:21:10,323 INFO L387 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 11 treesize of output 7 [2022-03-15 19:21:10,359 INFO L387 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-03-15 19:21:10,394 INFO L387 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-03-15 19:21:10,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:21:10,536 INFO L387 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 18 treesize of output 20 [2022-03-15 19:21:10,549 INFO L387 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 15 treesize of output 7 [2022-03-15 19:21:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:21:10,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:21:10,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int))) (= c_~res2~0 (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))))) is different from false [2022-03-15 19:21:10,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int))) (= c_~res2~0 (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 19:21:10,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) c_~res2~0) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 19:21:10,612 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res2~0) (+ c_~res1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 19:21:10,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_451))) (= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res2~0)))) is different from false [2022-03-15 19:21:10,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_450 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_451))) (= (+ c_~res2~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res1~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-03-15 19:21:10,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:21:10,633 INFO L387 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 54 treesize of output 43 [2022-03-15 19:21:10,636 INFO L387 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 11126 treesize of output 10358 [2022-03-15 19:21:10,670 INFO L387 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 10358 treesize of output 9846 [2022-03-15 19:21:10,701 INFO L387 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 9846 treesize of output 9078 [2022-03-15 19:21:10,732 INFO L387 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 9078 treesize of output 8694 Received shutdown request... [2022-03-15 19:34:40,489 WARN L244 SmtUtils]: Removed 1 from assertion stack [2022-03-15 19:34:40,491 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:34:40,494 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:34:40,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:40,528 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:34:40,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:34:40,710 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-2-2-2-2-1 context. [2022-03-15 19:34:40,711 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:34:40,712 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:34:40,712 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:34:40,713 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:40,715 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:34:40,715 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:34:40,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:34:40 BasicIcfg [2022-03-15 19:34:40,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:34:40,717 INFO L158 Benchmark]: Toolchain (without parser) took 856816.71ms. Allocated memory was 203.4MB in the beginning and 855.6MB in the end (delta: 652.2MB). Free memory was 152.1MB in the beginning and 728.0MB in the end (delta: -575.9MB). Peak memory consumption was 501.6MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,717 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:34:40,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.45ms. Allocated memory was 203.4MB in the beginning and 278.9MB in the end (delta: 75.5MB). Free memory was 182.3MB in the beginning and 254.2MB in the end (delta: -71.9MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 278.9MB. Free memory was 254.2MB in the beginning and 251.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,717 INFO L158 Benchmark]: Boogie Preprocessor took 31.67ms. Allocated memory is still 278.9MB. Free memory was 251.8MB in the beginning and 250.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,718 INFO L158 Benchmark]: RCFGBuilder took 601.93ms. Allocated memory is still 278.9MB. Free memory was 250.2MB in the beginning and 222.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,718 INFO L158 Benchmark]: TraceAbstraction took 855841.12ms. Allocated memory was 278.9MB in the beginning and 855.6MB in the end (delta: 576.7MB). Free memory was 221.9MB in the beginning and 728.0MB in the end (delta: -506.1MB). Peak memory consumption was 494.4MB. Max. memory is 8.0GB. [2022-03-15 19:34:40,731 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.10ms. Allocated memory is still 203.4MB. Free memory is still 168.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.45ms. Allocated memory was 203.4MB in the beginning and 278.9MB in the end (delta: 75.5MB). Free memory was 182.3MB in the beginning and 254.2MB in the end (delta: -71.9MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 278.9MB. Free memory was 254.2MB in the beginning and 251.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.67ms. Allocated memory is still 278.9MB. Free memory was 251.8MB in the beginning and 250.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 601.93ms. Allocated memory is still 278.9MB. Free memory was 250.2MB in the beginning and 222.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 855841.12ms. Allocated memory was 278.9MB in the beginning and 855.6MB in the end (delta: 576.7MB). Free memory was 221.9MB in the beginning and 728.0MB in the end (delta: -506.1MB). Peak memory consumption was 494.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 151 PlacesBefore, 34 PlacesAfterwards, 153 TransitionsBefore, 28 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 7 FixpointIterations, 94 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 149 TotalNumberOfCompositions, 1666 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1457, positive: 1421, positive conditional: 0, positive unconditional: 1421, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 703, positive: 692, positive conditional: 0, positive unconditional: 692, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1457, positive: 729, positive conditional: 0, positive unconditional: 729, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 703, unknown conditional: 0, unknown unconditional: 703] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 50, Positive conditional cache size: 0, Positive unconditional cache size: 50, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-6-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 855.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1077 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1077 mSDsluCounter, 724 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2932 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9293 IncrementalHoareTripleChecker+Invalid, 9463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 103 mSDtfsCounter, 9293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 1018 SyntacticMatches, 63 SemanticMatches, 344 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 10922 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=11, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 2008 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 535 ConstructedInterpolants, 45 QuantifiedInterpolants, 5540 SizeOfPredicates, 127 NumberOfNonLiveVariables, 1722 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 18/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown