/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-multiply-verify.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:26:32,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:26:32,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:26:32,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:26:32,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:26:32,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:26:32,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:26:32,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:26:32,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:26:32,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:26:32,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:26:32,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:26:32,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:26:32,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:26:32,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:26:32,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:26:32,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:26:32,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:26:32,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:26:32,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:26:32,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:26:32,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:26:32,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:26:32,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:26:32,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:26:32,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:26:32,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:26:32,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:26:32,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:26:32,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:26:32,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:26:32,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:26:32,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:26:32,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:26:32,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:26:32,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:26:32,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:26:32,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:26:32,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:26:32,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:26:32,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:26:32,868 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:26:32,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:26:32,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:26:32,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:26:32,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:26:32,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:26:32,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:26:32,897 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:26:32,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:26:32,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:26:32,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:26:32,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:26:32,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:26:32,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:26:32,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:26:32,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:26:32,900 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:26:32,900 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:26:33,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:26:33,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:26:33,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:26:33,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:26:33,103 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:26:33,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-03-15 19:26:33,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b5d5c07/14976432c9574472849244f70ef22118/FLAG68453f98d [2022-03-15 19:26:33,496 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:26:33,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2022-03-15 19:26:33,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b5d5c07/14976432c9574472849244f70ef22118/FLAG68453f98d [2022-03-15 19:26:33,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46b5d5c07/14976432c9574472849244f70ef22118 [2022-03-15 19:26:33,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:26:33,949 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:26:33,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:26:33,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:26:33,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:26:33,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:26:33" (1/1) ... [2022-03-15 19:26:33,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a77a133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:33, skipping insertion in model container [2022-03-15 19:26:33,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:26:33" (1/1) ... [2022-03-15 19:26:33,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:26:33,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:26:34,127 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-multiply-verify.wvr.c[3042,3055] [2022-03-15 19:26:34,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:26:34,136 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:26:34,150 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-multiply-verify.wvr.c[3042,3055] [2022-03-15 19:26:34,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:26:34,160 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:26:34,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34 WrapperNode [2022-03-15 19:26:34,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:26:34,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:26:34,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:26:34,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:26:34,165 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:26:34" (1/1) ... [2022-03-15 19:26:34,171 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:26:34" (1/1) ... [2022-03-15 19:26:34,187 INFO L137 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2022-03-15 19:26:34,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:26:34,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:26:34,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:26:34,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:26:34,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:26:34,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:26:34,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:26:34,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:26:34,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (1/1) ... [2022-03-15 19:26:34,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:26:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:34,247 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:26:34,252 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:26:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:26:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:26:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:26:34,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:26:34,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:26:34,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 19:26:34,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:26:34,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:26:34,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:26:34,274 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:26:34,329 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:26:34,330 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:26:34,547 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:26:34,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:26:34,604 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:26:34,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:26:34 BoogieIcfgContainer [2022-03-15 19:26:34,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:26:34,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:26:34,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:26:34,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:26:34,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:26:33" (1/3) ... [2022-03-15 19:26:34,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:26:34, skipping insertion in model container [2022-03-15 19:26:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:26:34" (2/3) ... [2022-03-15 19:26:34,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:26:34, skipping insertion in model container [2022-03-15 19:26:34,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:26:34" (3/3) ... [2022-03-15 19:26:34,611 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-03-15 19:26:34,614 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:26:34,614 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:26:34,614 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:26:34,614 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:26:34,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,670 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,671 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,672 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:26:34,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,672 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:26:34,672 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 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:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 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:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,673 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,674 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,675 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,676 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 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:26:34,677 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:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,677 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,678 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:26:34,678 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:26:34,678 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,678 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,678 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,678 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,678 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,679 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,680 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,680 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,680 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,680 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:26:34,680 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:26:34,680 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:26:34,680 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:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,681 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,682 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,683 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 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:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 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:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~x~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,693 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,695 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:26:34,695 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,695 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:26:34,696 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,696 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,696 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,696 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,697 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,697 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,697 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,697 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:26:34,697 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,698 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,698 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:26:34,698 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:26:34,702 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 19:26:34,754 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:26:34,761 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:26:34,762 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 19:26:34,776 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:26:34,781 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 154 transitions, 332 flow [2022-03-15 19:26:34,784 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 154 transitions, 332 flow [2022-03-15 19:26:34,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 154 transitions, 332 flow [2022-03-15 19:26:34,863 INFO L129 PetriNetUnfolder]: 9/151 cut-off events. [2022-03-15 19:26:34,864 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 19:26:34,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 9/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-03-15 19:26:34,872 INFO L116 LiptonReduction]: Number of co-enabled transitions 1464 [2022-03-15 19:26:38,517 INFO L131 LiptonReduction]: Checked pairs total: 1614 [2022-03-15 19:26:38,517 INFO L133 LiptonReduction]: Total number of compositions: 142 [2022-03-15 19:26:38,524 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 76 flow [2022-03-15 19:26:38,551 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 81 states, 80 states have (on average 2.7) internal successors, (216), 80 states have internal predecessors, (216), 0 states have call successors, (0), 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:26:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 80 states have (on average 2.7) internal successors, (216), 80 states have internal predecessors, (216), 0 states have call successors, (0), 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:26:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:26:38,563 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:38,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:38,563 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:26:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1915541050, now seen corresponding path program 1 times [2022-03-15 19:26:38,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:38,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585084424] [2022-03-15 19:26:38,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:38,831 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:26:38,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:38,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585084424] [2022-03-15 19:26:38,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585084424] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:26:38,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:26:38,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:26:38,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765338313] [2022-03-15 19:26:38,834 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:38,839 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:38,882 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 67 transitions. [2022-03-15 19:26:38,882 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:39,160 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [324#(<= ~n~0 1)] [2022-03-15 19:26:39,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:26:39,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:39,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:26:39,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:26:39,178 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 2.7) internal successors, (216), 80 states have internal predecessors, (216), 0 states have call successors, (0), 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 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:39,236 INFO L93 Difference]: Finished difference Result 103 states and 271 transitions. [2022-03-15 19:26:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:26:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:26:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:39,242 INFO L225 Difference]: With dead ends: 103 [2022-03-15 19:26:39,243 INFO L226 Difference]: Without dead ends: 82 [2022-03-15 19:26:39,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:26:39,245 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:39,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:26:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-03-15 19:26:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-03-15 19:26:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.6790123456790123) internal successors, (217), 81 states have internal predecessors, (217), 0 states have call successors, (0), 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:26:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 217 transitions. [2022-03-15 19:26:39,269 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 217 transitions. Word has length 19 [2022-03-15 19:26:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:39,269 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 217 transitions. [2022-03-15 19:26:39,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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:26:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 217 transitions. [2022-03-15 19:26:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:26:39,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:39,271 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:26:39,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:26:39,271 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:26:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1242683889, now seen corresponding path program 1 times [2022-03-15 19:26:39,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:39,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129876821] [2022-03-15 19:26:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:39,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129876821] [2022-03-15 19:26:39,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129876821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:39,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784061583] [2022-03-15 19:26:39,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:39,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:39,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:39,333 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:26:39,339 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:26:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:39,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:26:39,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:26:39,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784061583] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:39,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:39,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 19:26:39,585 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896493335] [2022-03-15 19:26:39,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:39,587 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:39,595 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2022-03-15 19:26:39,595 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:39,767 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:26:39,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:26:39,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:39,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:26:39,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:26:39,772 INFO L87 Difference]: Start difference. First operand 82 states and 217 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:39,840 INFO L93 Difference]: Finished difference Result 134 states and 345 transitions. [2022-03-15 19:26:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:26:39,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:26:39,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:39,844 INFO L225 Difference]: With dead ends: 134 [2022-03-15 19:26:39,844 INFO L226 Difference]: Without dead ends: 83 [2022-03-15 19:26:39,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:26:39,846 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:39,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:26:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-03-15 19:26:39,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-03-15 19:26:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.658536585365854) internal successors, (218), 82 states have internal predecessors, (218), 0 states have call successors, (0), 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:26:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 218 transitions. [2022-03-15 19:26:39,860 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 218 transitions. Word has length 20 [2022-03-15 19:26:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:39,861 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 218 transitions. [2022-03-15 19:26:39,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:39,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 218 transitions. [2022-03-15 19:26:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:39,861 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:39,861 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:39,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:26:40,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:40,079 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:26:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1858948378, now seen corresponding path program 2 times [2022-03-15 19:26:40,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:40,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115903950] [2022-03-15 19:26:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:40,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:40,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115903950] [2022-03-15 19:26:40,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115903950] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:26:40,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:26:40,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:26:40,159 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [633529440] [2022-03-15 19:26:40,159 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:40,161 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:40,198 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 19:26:40,199 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:40,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1024#(or (< ~start~0 0) (not (= ~end~0 (+ ~start~0 1)))), 1023#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)))] [2022-03-15 19:26:40,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:26:40,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:40,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:26:40,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:26:40,430 INFO L87 Difference]: Start difference. First operand 83 states and 218 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:40,487 INFO L93 Difference]: Finished difference Result 63 states and 144 transitions. [2022-03-15 19:26:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:26:40,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:40,488 INFO L225 Difference]: With dead ends: 63 [2022-03-15 19:26:40,488 INFO L226 Difference]: Without dead ends: 63 [2022-03-15 19:26:40,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:26:40,491 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:40,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:26:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-15 19:26:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-03-15 19:26:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.3225806451612905) internal successors, (144), 62 states have internal predecessors, (144), 0 states have call successors, (0), 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:26:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 144 transitions. [2022-03-15 19:26:40,496 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 144 transitions. Word has length 21 [2022-03-15 19:26:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:40,497 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 144 transitions. [2022-03-15 19:26:40,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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:26:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 144 transitions. [2022-03-15 19:26:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:40,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:40,498 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:40,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:26:40,498 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:26:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1928723080, now seen corresponding path program 3 times [2022-03-15 19:26:40,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:40,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184775054] [2022-03-15 19:26:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:41,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:26:41,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:41,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184775054] [2022-03-15 19:26:41,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184775054] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:41,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526869549] [2022-03-15 19:26:41,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:26:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:41,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:41,264 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:26:41,293 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:26:41,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 19:26:41,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:41,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:26:41,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:41,549 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:26:41,549 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 89 treesize of output 35 [2022-03-15 19:26:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:41,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:26:41,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526869549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:26:41,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:26:41,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 17 [2022-03-15 19:26:41,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854119558] [2022-03-15 19:26:41,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:41,571 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:41,581 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 74 transitions. [2022-03-15 19:26:41,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:42,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [1295#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 1297#(or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))), 1296#(and (or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))) (or (< ~end~0 0) (= |thread1Thread1of1ForFork2_~x~0#1| 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0)))), 1294#(and (or (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 0) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))) (or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))))), 1293#(and (or (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 0) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))) (or (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (= |thread1Thread1of1ForFork2_~x~0#1| 0)) (or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))))] [2022-03-15 19:26:42,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:26:42,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:42,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:26:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:26:42,291 INFO L87 Difference]: Start difference. First operand 63 states and 144 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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:26:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:42,601 INFO L93 Difference]: Finished difference Result 131 states and 327 transitions. [2022-03-15 19:26:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:26:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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:26:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:42,603 INFO L225 Difference]: With dead ends: 131 [2022-03-15 19:26:42,603 INFO L226 Difference]: Without dead ends: 117 [2022-03-15 19:26:42,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:26:42,604 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:42,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:26:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-03-15 19:26:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 79. [2022-03-15 19:26:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.4871794871794872) internal successors, (194), 78 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:26:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 194 transitions. [2022-03-15 19:26:42,607 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 194 transitions. Word has length 21 [2022-03-15 19:26:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:42,608 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 194 transitions. [2022-03-15 19:26:42,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 0 states have call successors, (0), 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:26:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 194 transitions. [2022-03-15 19:26:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:42,608 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:42,608 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:42,627 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:26:42,825 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,SelfDestructingSolverStorable3 [2022-03-15 19:26:42,825 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:26:42,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:42,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1198841708, now seen corresponding path program 4 times [2022-03-15 19:26:42,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:42,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180073780] [2022-03-15 19:26:42,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:42,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:43,194 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:26:43,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:43,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180073780] [2022-03-15 19:26:43,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180073780] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:43,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832301356] [2022-03-15 19:26:43,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:26:43,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:43,196 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:26:43,222 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:26:43,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:26:43,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:26:43,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:43,356 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 15 treesize of output 11 [2022-03-15 19:26:43,390 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:26:43,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 6 treesize of output 5 [2022-03-15 19:26:43,448 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:26:43,613 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:26:43,613 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 86 treesize of output 35 [2022-03-15 19:26:43,631 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:26:43,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:44,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:26:44,285 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 138 treesize of output 102 [2022-03-15 19:26:44,334 INFO L353 Elim1Store]: treesize reduction 67, result has 35.0 percent of original size [2022-03-15 19:26:44,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4834 treesize of output 4597 [2022-03-15 19:26:44,392 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-03-15 19:26:44,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4562 treesize of output 3758 [2022-03-15 19:26:44,446 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-03-15 19:26:44,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3730 treesize of output 3550 [2022-03-15 19:26:44,515 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2022-03-15 19:26:44,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3522 treesize of output 3134 [2022-03-15 19:26:48,847 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:26:48,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832301356] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:26:48,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:26:48,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2022-03-15 19:26:48,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196968021] [2022-03-15 19:26:48,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:48,852 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:48,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 82 transitions. [2022-03-15 19:26:48,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:50,086 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [1747#(and (= ~start~0 ~end~0) (= ~queue~0.offset 0) (<= (* ~n~0 4) 8) (= |thread1Thread1of1ForFork2_~x~0#1| 0)), 1748#(or (< ~start~0 0) (<= ~n~0 (+ ~start~0 1)) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 1746#(and (or (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (* (- 1) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)))) 0))) (= ~queue~0.offset 0) (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (not (= (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (* (- 1) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)))) 0))) (or (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))))] [2022-03-15 19:26:50,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:26:50,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:26:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1020, Unknown=8, NotChecked=0, Total=1260 [2022-03-15 19:26:50,103 INFO L87 Difference]: Start difference. First operand 79 states and 194 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:50,741 INFO L93 Difference]: Finished difference Result 198 states and 524 transitions. [2022-03-15 19:26:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:26:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:50,743 INFO L225 Difference]: With dead ends: 198 [2022-03-15 19:26:50,743 INFO L226 Difference]: Without dead ends: 184 [2022-03-15 19:26:50,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=317, Invalid=1481, Unknown=8, NotChecked=0, Total=1806 [2022-03-15 19:26:50,744 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:50,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:26:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-03-15 19:26:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 117. [2022-03-15 19:26:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.6724137931034484) internal successors, (310), 116 states have internal predecessors, (310), 0 states have call successors, (0), 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:26:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 310 transitions. [2022-03-15 19:26:50,750 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 310 transitions. Word has length 21 [2022-03-15 19:26:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:50,750 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 310 transitions. [2022-03-15 19:26:50,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 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:26:50,750 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 310 transitions. [2022-03-15 19:26:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:50,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:50,751 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:50,771 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:26:50,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:50,955 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:26:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1514453624, now seen corresponding path program 5 times [2022-03-15 19:26:50,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:50,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529137137] [2022-03-15 19:26:50,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:50,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:51,870 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:26:51,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:51,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529137137] [2022-03-15 19:26:51,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529137137] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:51,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884516419] [2022-03-15 19:26:51,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:26:51,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:51,872 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:26:51,873 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:26:51,966 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:26:51,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:51,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:26:51,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:52,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:52,114 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 20 treesize of output 22 [2022-03-15 19:26:52,242 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:26:52,242 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 86 treesize of output 35 [2022-03-15 19:26:52,265 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:26:52,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:52,420 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~queue~0.base))) (or (not (= (mod (select .cse0 (+ (* c_~end~0 4) c_~queue~0.offset)) 4294967296) 0)) (let ((.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296)))))) is different from false [2022-03-15 19:26:52,469 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:26:52,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 126 [2022-03-15 19:26:52,495 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:26:52,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 60 [2022-03-15 19:26:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:52,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884516419] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:52,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:26:52,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 28 [2022-03-15 19:26:52,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352788174] [2022-03-15 19:26:52,893 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:52,897 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:52,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 19:26:52,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:53,109 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2345#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)))] [2022-03-15 19:26:53,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:26:53,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:26:53,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=773, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:26:53,111 INFO L87 Difference]: Start difference. First operand 117 states and 310 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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:26:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:53,481 INFO L93 Difference]: Finished difference Result 178 states and 441 transitions. [2022-03-15 19:26:53,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:26:53,482 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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:26:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:53,483 INFO L225 Difference]: With dead ends: 178 [2022-03-15 19:26:53,483 INFO L226 Difference]: Without dead ends: 164 [2022-03-15 19:26:53,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=1060, Unknown=1, NotChecked=66, Total=1260 [2022-03-15 19:26:53,484 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:53,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 268 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-03-15 19:26:53,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-03-15 19:26:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2022-03-15 19:26:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.6666666666666665) internal successors, (312), 117 states have internal predecessors, (312), 0 states have call successors, (0), 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:26:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 312 transitions. [2022-03-15 19:26:53,489 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 312 transitions. Word has length 21 [2022-03-15 19:26:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:53,489 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 312 transitions. [2022-03-15 19:26:53,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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:26:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 312 transitions. [2022-03-15 19:26:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:53,490 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:53,490 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:53,512 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:26:53,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:53,708 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:26:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1297708954, now seen corresponding path program 6 times [2022-03-15 19:26:53,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:53,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58138401] [2022-03-15 19:26:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:53,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:54,295 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:26:54,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:54,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58138401] [2022-03-15 19:26:54,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58138401] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:54,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744337927] [2022-03-15 19:26:54,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:26:54,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:54,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:54,308 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:26:54,310 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:26:54,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 19:26:54,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:54,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:26:54,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:54,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:54,539 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 21 treesize of output 23 [2022-03-15 19:26:54,610 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:26:54,611 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 89 treesize of output 35 [2022-03-15 19:26:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:54,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:26:54,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744337927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:26:54,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:26:54,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 18 [2022-03-15 19:26:54,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145333083] [2022-03-15 19:26:54,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:54,638 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:54,643 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 19:26:54,643 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:55,251 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2853#(and (= (mod (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) 4294967296) 0) (= ~end~0 (+ ~start~0 1))), 2855#(and (or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))) (or (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< ~end~0 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))) (or (< ~end~0 0) (= |thread1Thread1of1ForFork2_~x~0#1| 0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0)))), 2851#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))), 2852#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))), 2850#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 2854#(and (or (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (= |thread1Thread1of1ForFork2_~x~0#1| 0)) (or (< ~end~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))) (or (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))) (or (= ~start~0 ~end~0) (< ~end~0 0) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))))] [2022-03-15 19:26:55,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:26:55,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:26:55,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:26:55,252 INFO L87 Difference]: Start difference. First operand 118 states and 312 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:26:55,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:55,765 INFO L93 Difference]: Finished difference Result 203 states and 536 transitions. [2022-03-15 19:26:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 19:26:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:26:55,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:55,766 INFO L225 Difference]: With dead ends: 203 [2022-03-15 19:26:55,766 INFO L226 Difference]: Without dead ends: 189 [2022-03-15 19:26:55,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:26:55,767 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:55,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:26:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-03-15 19:26:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 125. [2022-03-15 19:26:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.7338709677419355) internal successors, (339), 124 states have internal predecessors, (339), 0 states have call successors, (0), 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:26:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 339 transitions. [2022-03-15 19:26:55,772 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 339 transitions. Word has length 21 [2022-03-15 19:26:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:55,772 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 339 transitions. [2022-03-15 19:26:55,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 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:26:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 339 transitions. [2022-03-15 19:26:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:55,773 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:55,773 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:55,790 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:26:55,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:55,983 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:26:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1035131354, now seen corresponding path program 7 times [2022-03-15 19:26:55,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:55,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305253225] [2022-03-15 19:26:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:56,656 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:26:56,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:56,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305253225] [2022-03-15 19:26:56,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305253225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:56,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98406376] [2022-03-15 19:26:56,657 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:26:56,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:56,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:56,658 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:26:56,659 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:26:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:56,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:26:56,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:56,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:26:56,941 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 34 treesize of output 34 [2022-03-15 19:26:56,989 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:26:56,989 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 89 treesize of output 35 [2022-03-15 19:26:57,018 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:26:57,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:26:57,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_337) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296)))) is different from false [2022-03-15 19:26:57,203 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:26:57,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 103 [2022-03-15 19:26:57,211 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:26:57,212 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 24 treesize of output 11 [2022-03-15 19:26:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:57,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98406376] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:57,971 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:26:57,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 28 [2022-03-15 19:26:57,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785783660] [2022-03-15 19:26:57,971 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:57,973 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:57,977 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:26:57,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:26:58,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3473#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)))] [2022-03-15 19:26:58,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:26:58,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:26:58,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:26:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=774, Unknown=1, NotChecked=56, Total=930 [2022-03-15 19:26:58,218 INFO L87 Difference]: Start difference. First operand 125 states and 339 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:26:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:26:58,464 INFO L93 Difference]: Finished difference Result 178 states and 451 transitions. [2022-03-15 19:26:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:26:58,465 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:26:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:26:58,466 INFO L225 Difference]: With dead ends: 178 [2022-03-15 19:26:58,466 INFO L226 Difference]: Without dead ends: 163 [2022-03-15 19:26:58,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1002, Unknown=1, NotChecked=64, Total=1190 [2022-03-15 19:26:58,466 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:26:58,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 124 Unchecked, 0.1s Time] [2022-03-15 19:26:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-03-15 19:26:58,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2022-03-15 19:26:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.728) internal successors, (341), 125 states have internal predecessors, (341), 0 states have call successors, (0), 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:26:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 341 transitions. [2022-03-15 19:26:58,470 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 341 transitions. Word has length 21 [2022-03-15 19:26:58,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:26:58,470 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 341 transitions. [2022-03-15 19:26:58,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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:26:58,470 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 341 transitions. [2022-03-15 19:26:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:26:58,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:26:58,471 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:26:58,489 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:26:58,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:58,671 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:26:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:26:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -456961712, now seen corresponding path program 8 times [2022-03-15 19:26:58,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:26:58,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327345511] [2022-03-15 19:26:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:26:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:26:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:26:59,190 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:26:59,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:26:59,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327345511] [2022-03-15 19:26:59,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327345511] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:26:59,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224506962] [2022-03-15 19:26:59,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:26:59,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:26:59,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:26:59,192 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:26:59,226 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:26:59,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 19:26:59,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:26:59,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:26:59,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:26:59,315 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 96 treesize of output 94 [2022-03-15 19:26:59,451 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 20 treesize of output 22 [2022-03-15 19:26:59,517 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:26:59,517 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 89 treesize of output 35 [2022-03-15 19:26:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:26:59,534 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:26:59,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224506962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:26:59,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:26:59,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 18 [2022-03-15 19:26:59,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563745135] [2022-03-15 19:26:59,534 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:26:59,536 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:26:59,541 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 59 transitions. [2022-03-15 19:26:59,541 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:00,105 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [3995#(and (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 0) (= ~end~0 (+ ~start~0 1))), 3992#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 3993#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))), 3996#(and (= ~start~0 ~end~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= |thread1Thread1of1ForFork2_~x~0#1| 0)), 3994#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0)))] [2022-03-15 19:27:00,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:27:00,106 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:27:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:27:00,107 INFO L87 Difference]: Start difference. First operand 126 states and 341 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:00,524 INFO L93 Difference]: Finished difference Result 229 states and 590 transitions. [2022-03-15 19:27:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:27:00,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:00,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:00,526 INFO L225 Difference]: With dead ends: 229 [2022-03-15 19:27:00,526 INFO L226 Difference]: Without dead ends: 215 [2022-03-15 19:27:00,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:27:00,527 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:00,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:27:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-15 19:27:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 106. [2022-03-15 19:27:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.6095238095238096) internal successors, (274), 105 states have internal predecessors, (274), 0 states have call successors, (0), 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:27:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 274 transitions. [2022-03-15 19:27:00,530 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 274 transitions. Word has length 21 [2022-03-15 19:27:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:00,530 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 274 transitions. [2022-03-15 19:27:00,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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:27:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 274 transitions. [2022-03-15 19:27:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:00,531 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:00,531 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:00,554 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:27:00,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:00,731 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:27:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash -845576560, now seen corresponding path program 9 times [2022-03-15 19:27:00,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:00,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282167388] [2022-03-15 19:27:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:01,222 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:27:01,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:01,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282167388] [2022-03-15 19:27:01,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282167388] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:01,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294928388] [2022-03-15 19:27:01,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:27:01,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:01,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:01,224 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:27:01,251 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:27:01,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-03-15 19:27:01,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:01,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:27:01,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:01,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:01,588 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 34 treesize of output 34 [2022-03-15 19:27:01,637 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:27:01,637 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 89 treesize of output 35 [2022-03-15 19:27:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:01,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:27:01,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294928388] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:27:01,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:27:01,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-03-15 19:27:01,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875958658] [2022-03-15 19:27:01,663 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:01,665 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:01,669 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2022-03-15 19:27:01,669 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:01,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4533#(and (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= (mod (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) 4294967296) 0) (= ~end~0 (+ ~start~0 1))), 4535#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 4534#(and (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~start~0 ~end~0) (= |thread1Thread1of1ForFork2_~x~0#1| 0))] [2022-03-15 19:27:01,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:27:01,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:01,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:27:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:27:01,927 INFO L87 Difference]: Start difference. First operand 106 states and 274 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:27:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:02,168 INFO L93 Difference]: Finished difference Result 172 states and 431 transitions. [2022-03-15 19:27:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:27:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:27:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:02,169 INFO L225 Difference]: With dead ends: 172 [2022-03-15 19:27:02,169 INFO L226 Difference]: Without dead ends: 157 [2022-03-15 19:27:02,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:27:02,170 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:02,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:27:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-03-15 19:27:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 108. [2022-03-15 19:27:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.5794392523364484) internal successors, (276), 107 states have internal predecessors, (276), 0 states have call successors, (0), 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:27:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 276 transitions. [2022-03-15 19:27:02,175 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 276 transitions. Word has length 21 [2022-03-15 19:27:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:02,177 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 276 transitions. [2022-03-15 19:27:02,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 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:27:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 276 transitions. [2022-03-15 19:27:02,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:02,178 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:02,178 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:02,196 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:27:02,391 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,SelfDestructingSolverStorable9 [2022-03-15 19:27:02,391 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:27:02,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1811818280, now seen corresponding path program 10 times [2022-03-15 19:27:02,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:02,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033463996] [2022-03-15 19:27:02,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:03,009 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:27:03,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:03,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033463996] [2022-03-15 19:27:03,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033463996] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:03,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807042662] [2022-03-15 19:27:03,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:27:03,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:03,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:03,010 INFO L229 MonitoredProcess]: Starting monitored process 10 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:27:03,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:27:03,088 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:27:03,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:03,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:27:03,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:03,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:03,302 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 34 treesize of output 34 [2022-03-15 19:27:03,346 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:27:03,347 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 89 treesize of output 35 [2022-03-15 19:27:03,373 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:27:03,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:03,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_487) c_~queue~0.base)) (.cse1 (* c_~start~0 4))) (= (mod (select .cse0 (+ .cse1 c_~queue~0.offset 4)) 4294967296) (mod (select .cse0 (+ .cse1 c_~queue~0.offset)) 4294967296)))) is different from false [2022-03-15 19:27:03,531 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:27:03,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 105 [2022-03-15 19:27:03,544 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-03-15 19:27:03,544 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 24 treesize of output 11 [2022-03-15 19:27:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:03,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807042662] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:03,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:27:03,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 9] total 28 [2022-03-15 19:27:03,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237822146] [2022-03-15 19:27:03,800 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:03,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:03,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 39 transitions. [2022-03-15 19:27:03,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:04,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [5085#(and (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* ~start~0 4) (* ~end~0 4))), 5084#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)))] [2022-03-15 19:27:04,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:27:04,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:04,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:27:04,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=824, Unknown=1, NotChecked=58, Total=992 [2022-03-15 19:27:04,059 INFO L87 Difference]: Start difference. First operand 108 states and 276 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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:27:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:04,375 INFO L93 Difference]: Finished difference Result 176 states and 424 transitions. [2022-03-15 19:27:04,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:27:04,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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:27:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:04,376 INFO L225 Difference]: With dead ends: 176 [2022-03-15 19:27:04,376 INFO L226 Difference]: Without dead ends: 161 [2022-03-15 19:27:04,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=1184, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:27:04,377 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:04,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 0 Unknown, 185 Unchecked, 0.2s Time] [2022-03-15 19:27:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-15 19:27:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 108. [2022-03-15 19:27:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 2.5700934579439254) internal successors, (275), 107 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:27:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 275 transitions. [2022-03-15 19:27:04,380 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 275 transitions. Word has length 21 [2022-03-15 19:27:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:04,380 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 275 transitions. [2022-03-15 19:27:04,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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:27:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 275 transitions. [2022-03-15 19:27:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:04,380 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:04,380 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:04,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:04,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:04,581 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:27:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 70355096, now seen corresponding path program 11 times [2022-03-15 19:27:04,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:04,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163787602] [2022-03-15 19:27:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:05,436 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:27:05,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:05,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163787602] [2022-03-15 19:27:05,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163787602] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:05,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842197197] [2022-03-15 19:27:05,436 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:27:05,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:05,437 INFO L229 MonitoredProcess]: Starting monitored process 11 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:27:05,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:27:05,517 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:27:05,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:05,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:27:05,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:05,581 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 15 treesize of output 11 [2022-03-15 19:27:05,614 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:27:05,677 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:27:05,705 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:27:05,880 INFO L353 Elim1Store]: treesize reduction 93, result has 7.0 percent of original size [2022-03-15 19:27:05,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 41 [2022-03-15 19:27:05,910 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:27:05,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:07,104 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:27:07,104 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 137 treesize of output 101 [2022-03-15 19:27:07,165 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:27:07,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1170 treesize of output 1156 [2022-03-15 19:27:07,230 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:27:07,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1104 treesize of output 956 [2022-03-15 19:27:07,298 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:27:07,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 904 treesize of output 906 [2022-03-15 19:27:07,361 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:27:07,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 854 treesize of output 806 [2022-03-15 19:27:16,879 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:27:16,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842197197] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:16,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:16,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-03-15 19:27:16,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664210246] [2022-03-15 19:27:16,879 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:16,881 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:16,887 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 74 transitions. [2022-03-15 19:27:16,888 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:19,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [5645#(or (< ~start~0 0) (<= ~n~0 (+ ~start~0 1)) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 5653#(and (or (= (+ (- 2) ~n~0) 0) (= ~start~0 0)) (or (not (= ~end~0 0)) (= ~start~0 0)) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)) (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483648)) (not (= ~start~0 0))) (or (= 0 (+ (* (- 1) ~end~0) ~start~0)) (not (= ~start~0 0))) (or (not (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483647) (not (= ~start~0 0))) (or (= ~queue~0.offset 0) (not (= ~start~0 0)))), 5652#(or (not (= ~start~0 ~end~0)) (not (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))) (<= ~n~0 (+ ~start~0 1)) (< ~end~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))), 5647#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (<= ~n~0 ~end~0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0))), 5648#(or (not (= ~start~0 ~end~0)) (not (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))) (<= ~n~0 (+ ~start~0 1)) (< ~end~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))), 5650#(and (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (not (= ~start~0 0))) (or (= (+ (- 2) ~n~0) 0) (= ~start~0 0)) (or (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (not (= ~start~0 0))) (or (= ~start~0 0) (<= 2 ~end~0)) (or (<= (+ ~start~0 1) ~end~0) (not (<= 1 (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (not (= ~start~0 0))) (or (not (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)))) (not (<= 1 (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (not (= ~start~0 0))) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)) (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483648)) (not (= ~start~0 0))) (or (< (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 1) (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (not (= ~start~0 0))) (or (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (<= ~end~0 (+ ~start~0 1)) (not (= ~start~0 0))) (or (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296))) (<= 1 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (<= (+ ~start~0 1) ~end~0) (not (= ~start~0 0))) (or (<= ~end~0 (+ ~start~0 1)) (not (<= 1 (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (not (= ~start~0 0))) (or (= ~queue~0.offset 0) (not (= ~start~0 0)))), 5649#(or (not (= ~start~0 ~end~0)) (<= ~n~0 (+ ~start~0 1)) (< ~end~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 0)) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))), 5646#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (<= ~n~0 ~end~0)), 5651#(and (or (= (+ (- 2) ~n~0) 0) (= ~start~0 0)) (or (= |thread2Thread1of1ForFork0_~x~1#1| 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483647) (not (= ~start~0 0))) (or (not (= ~end~0 0)) (= ~start~0 0)) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)) (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483648)) (not (= ~start~0 0))) (or (<= 1 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4))) (= |thread2Thread1of1ForFork0_~x~1#1| 0) (not (= ~start~0 0))) (or (= 0 (+ (* (- 1) ~end~0) ~start~0)) (not (= ~start~0 0))) (or (not (<= (+ (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296) 4294967296) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (* (div (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 4294967296)))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483647) (not (= ~start~0 0))) (or (= ~queue~0.offset 0) (not (= ~start~0 0)))), 5654#(and (or (= (+ (- 2) ~n~0) 0) (= ~start~0 0)) (or (<= 0 (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483648)) (not (= ~start~0 0))) (or (not (= ~end~0 0)) (= ~start~0 0)) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~start~0 0))) (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 2147483647) (not (= ~start~0 0))) (or (= 0 (+ (* (- 1) ~end~0) ~start~0)) (not (= ~start~0 0))) (or (= ~queue~0.offset 0) (not (= ~start~0 0))))] [2022-03-15 19:27:19,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:27:19,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:27:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1706, Unknown=16, NotChecked=0, Total=1980 [2022-03-15 19:27:19,343 INFO L87 Difference]: Start difference. First operand 108 states and 275 transitions. Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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:27:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:21,506 INFO L93 Difference]: Finished difference Result 396 states and 1018 transitions. [2022-03-15 19:27:21,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:27:21,507 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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:27:21,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:21,509 INFO L225 Difference]: With dead ends: 396 [2022-03-15 19:27:21,509 INFO L226 Difference]: Without dead ends: 382 [2022-03-15 19:27:21,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=519, Invalid=3247, Unknown=16, NotChecked=0, Total=3782 [2022-03-15 19:27:21,510 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:21,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:27:21,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-03-15 19:27:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 115. [2022-03-15 19:27:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.587719298245614) internal successors, (295), 114 states have internal predecessors, (295), 0 states have call successors, (0), 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:27:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 295 transitions. [2022-03-15 19:27:21,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 295 transitions. Word has length 21 [2022-03-15 19:27:21,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:21,526 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 295 transitions. [2022-03-15 19:27:21,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 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:27:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 295 transitions. [2022-03-15 19:27:21,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:21,527 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:21,527 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:21,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:21,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:27:21,744 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 236379544, now seen corresponding path program 12 times [2022-03-15 19:27:21,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:21,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752924700] [2022-03-15 19:27:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:22,453 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:27:22,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:22,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752924700] [2022-03-15 19:27:22,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752924700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:22,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489362473] [2022-03-15 19:27:22,454 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:27:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:22,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:22,455 INFO L229 MonitoredProcess]: Starting monitored process 12 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:27:22,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:27:22,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-03-15 19:27:22,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:22,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-03-15 19:27:22,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:22,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:22,685 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 20 treesize of output 22 [2022-03-15 19:27:22,762 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:27:22,763 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 89 treesize of output 35 [2022-03-15 19:27:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:22,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:27:22,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489362473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:27:22,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:27:22,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 19 [2022-03-15 19:27:22,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538486614] [2022-03-15 19:27:22,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:22,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:22,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 19:27:22,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:23,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [6401#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod |thread1Thread1of1ForFork2_~x~0#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296)))), 6400#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 6403#(and (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) 0) (= ~end~0 (+ ~start~0 1))), 6404#(and (< (+ ~queue~0.base 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~start~0 ~end~0) (= |thread2Thread1of1ForFork0_~x~1#1| 0)), 6402#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0)))] [2022-03-15 19:27:23,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:27:23,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:27:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:27:23,205 INFO L87 Difference]: Start difference. First operand 115 states and 295 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:23,666 INFO L93 Difference]: Finished difference Result 199 states and 479 transitions. [2022-03-15 19:27:23,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:27:23,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:23,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:23,667 INFO L225 Difference]: With dead ends: 199 [2022-03-15 19:27:23,667 INFO L226 Difference]: Without dead ends: 185 [2022-03-15 19:27:23,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:27:23,668 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:23,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:27:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-03-15 19:27:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 98. [2022-03-15 19:27:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.4329896907216493) internal successors, (236), 97 states have internal predecessors, (236), 0 states have call successors, (0), 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:27:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 236 transitions. [2022-03-15 19:27:23,671 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 236 transitions. Word has length 21 [2022-03-15 19:27:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:23,671 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 236 transitions. [2022-03-15 19:27:23,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 236 transitions. [2022-03-15 19:27:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:23,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:23,671 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:23,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:23,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:27:23,887 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -572652390, now seen corresponding path program 13 times [2022-03-15 19:27:23,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:23,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497251125] [2022-03-15 19:27:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:24,403 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:27:24,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:24,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497251125] [2022-03-15 19:27:24,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497251125] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:24,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022153837] [2022-03-15 19:27:24,404 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:27:24,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:24,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:24,405 INFO L229 MonitoredProcess]: Starting monitored process 13 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:27:24,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:27:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:24,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjunts are in the unsatisfiable core [2022-03-15 19:27:24,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:24,746 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 21 treesize of output 23 [2022-03-15 19:27:24,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:24,780 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 21 treesize of output 23 [2022-03-15 19:27:24,886 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:27:24,886 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 89 treesize of output 35 [2022-03-15 19:27:24,907 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:27:24,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:25,293 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:27:25,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 432 treesize of output 424 [2022-03-15 19:27:25,323 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:27:25,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 364 treesize of output 350 [2022-03-15 19:27:25,349 INFO L353 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-03-15 19:27:25,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 324 treesize of output 270 [2022-03-15 19:27:26,613 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:27:26,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022153837] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:27:26,613 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:27:26,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-03-15 19:27:26,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074227346] [2022-03-15 19:27:26,613 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:26,615 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:26,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 49 transitions. [2022-03-15 19:27:26,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:27,432 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6968#(or (< ~start~0 0) (<= ~n~0 (+ ~start~0 1)) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296))), 6969#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (not (= (mod |thread2Thread1of1ForFork0_~x~1#1| 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296))) (<= ~n~0 ~end~0)), 6970#(or (< ~start~0 0) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)) (not (= ~end~0 (+ ~start~0 1))) (<= ~n~0 ~end~0) (not (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) 4294967296) 0)))] [2022-03-15 19:27:27,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:27:27,433 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:27:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1129, Unknown=5, NotChecked=0, Total=1332 [2022-03-15 19:27:27,433 INFO L87 Difference]: Start difference. First operand 98 states and 236 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:28,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:28,168 INFO L93 Difference]: Finished difference Result 250 states and 594 transitions. [2022-03-15 19:27:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:27:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:28,171 INFO L225 Difference]: With dead ends: 250 [2022-03-15 19:27:28,171 INFO L226 Difference]: Without dead ends: 236 [2022-03-15 19:27:28,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=296, Invalid=1591, Unknown=5, NotChecked=0, Total=1892 [2022-03-15 19:27:28,172 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:28,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:27:28,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-03-15 19:27:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 106. [2022-03-15 19:27:28,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.3904761904761904) internal successors, (251), 105 states have internal predecessors, (251), 0 states have call successors, (0), 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:27:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 251 transitions. [2022-03-15 19:27:28,176 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 251 transitions. Word has length 21 [2022-03-15 19:27:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:28,176 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 251 transitions. [2022-03-15 19:27:28,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 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:27:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 251 transitions. [2022-03-15 19:27:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:27:28,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:28,177 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:28,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:28,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:27:28,387 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:28,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash 125439898, now seen corresponding path program 14 times [2022-03-15 19:27:28,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:28,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273952893] [2022-03-15 19:27:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:28,861 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:27:28,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:28,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273952893] [2022-03-15 19:27:28,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273952893] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:28,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3837348] [2022-03-15 19:27:28,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:27:28,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:28,862 INFO L229 MonitoredProcess]: Starting monitored process 14 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:27:28,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:27:28,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-15 19:27:28,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:27:28,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:27:28,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:29,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:29,101 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 20 treesize of output 22 [2022-03-15 19:27:29,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:27:29,206 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 34 treesize of output 34 [2022-03-15 19:27:29,253 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-03-15 19:27:29,253 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 89 treesize of output 35 [2022-03-15 19:27:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:29,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:27:29,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3837348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:27:29,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:27:29,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2022-03-15 19:27:29,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099848469] [2022-03-15 19:27:29,281 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:29,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:29,286 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2022-03-15 19:27:29,286 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:29,475 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7529#(or (< ~start~0 0) (not (= (+ ~start~0 2) ~end~0)) (= (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 4294967296) (mod (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) 4294967296)))] [2022-03-15 19:27:29,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:27:29,476 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:27:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:27:29,476 INFO L87 Difference]: Start difference. First operand 106 states and 251 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:29,760 INFO L93 Difference]: Finished difference Result 176 states and 399 transitions. [2022-03-15 19:27:29,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:27:29,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:29,761 INFO L225 Difference]: With dead ends: 176 [2022-03-15 19:27:29,761 INFO L226 Difference]: Without dead ends: 161 [2022-03-15 19:27:29,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:27:29,762 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:29,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:27:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-03-15 19:27:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 99. [2022-03-15 19:27:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.4183673469387754) internal successors, (237), 98 states have internal predecessors, (237), 0 states have call successors, (0), 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:27:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 237 transitions. [2022-03-15 19:27:29,764 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 237 transitions. Word has length 21 [2022-03-15 19:27:29,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:29,764 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 237 transitions. [2022-03-15 19:27:29,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 237 transitions. [2022-03-15 19:27:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:27:29,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:29,765 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:29,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:27:29,965 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2004362589, now seen corresponding path program 1 times [2022-03-15 19:27:29,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:29,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382942452] [2022-03-15 19:27:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:29,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:30,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382942452] [2022-03-15 19:27:30,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382942452] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:30,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279405542] [2022-03-15 19:27:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:30,020 INFO L229 MonitoredProcess]: Starting monitored process 15 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:27:30,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:27:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:30,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:27:30,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:30,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:30,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279405542] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:30,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:27:30,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2022-03-15 19:27:30,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1547218334] [2022-03-15 19:27:30,184 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:30,186 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:30,213 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 92 transitions. [2022-03-15 19:27:30,213 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:30,467 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8044#(or (< (mod |thread1Thread1of1ForFork2_~i~0#1| 4294967296) (mod ~A~0 4294967296)) (<= (mod ~A~0 4294967296) 0))] [2022-03-15 19:27:30,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:27:30,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:27:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:27:30,468 INFO L87 Difference]: Start difference. First operand 99 states and 237 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:27:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:30,536 INFO L93 Difference]: Finished difference Result 129 states and 296 transitions. [2022-03-15 19:27:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:27:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 22 [2022-03-15 19:27:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:30,537 INFO L225 Difference]: With dead ends: 129 [2022-03-15 19:27:30,537 INFO L226 Difference]: Without dead ends: 129 [2022-03-15 19:27:30,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:27:30,537 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:30,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:27:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-03-15 19:27:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2022-03-15 19:27:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.5) internal successors, (245), 98 states have internal predecessors, (245), 0 states have call successors, (0), 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:27:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 245 transitions. [2022-03-15 19:27:30,540 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 245 transitions. Word has length 22 [2022-03-15 19:27:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:30,540 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 245 transitions. [2022-03-15 19:27:30,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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:27:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 245 transitions. [2022-03-15 19:27:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:27:30,540 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:30,540 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:27:30,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:30,747 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:30,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:30,748 INFO L85 PathProgramCache]: Analyzing trace with hash -424645622, now seen corresponding path program 1 times [2022-03-15 19:27:30,749 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:30,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067117215] [2022-03-15 19:27:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:30,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:30,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067117215] [2022-03-15 19:27:30,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067117215] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:27:30,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:27:30,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:27:30,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332865851] [2022-03-15 19:27:30,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:30,790 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:30,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 104 transitions. [2022-03-15 19:27:30,799 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:31,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [8378#(< 0 (mod ~A~0 4294967296)), 8381#(or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~A~0 4294967296)) (<= (mod ~A~0 4294967296) 0)), 8380#(or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< 0 (mod ~A~0 4294967296))), 8379#(and (or (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~A~0 4294967296)) (<= (mod ~A~0 4294967296) (mod |thread1Thread1of1ForFork2_~i~0#1| 4294967296))) (or (= |thread1Thread1of1ForFork2_~i~0#1| 0) (< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~A~0 4294967296)))), 8377#(< (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296) (mod ~A~0 4294967296))] [2022-03-15 19:27:31,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:27:31,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:27:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:27:31,175 INFO L87 Difference]: Start difference. First operand 99 states and 245 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 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:27:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:31,318 INFO L93 Difference]: Finished difference Result 117 states and 281 transitions. [2022-03-15 19:27:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:27:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 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:27:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:31,319 INFO L225 Difference]: With dead ends: 117 [2022-03-15 19:27:31,319 INFO L226 Difference]: Without dead ends: 109 [2022-03-15 19:27:31,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:27:31,320 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:31,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:27:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-15 19:27:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2022-03-15 19:27:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5425531914893615) internal successors, (239), 94 states have internal predecessors, (239), 0 states have call successors, (0), 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:27:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2022-03-15 19:27:31,322 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 22 [2022-03-15 19:27:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:31,322 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2022-03-15 19:27:31,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 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:27:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2022-03-15 19:27:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:27:31,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:31,323 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:27:31,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-15 19:27:31,323 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash 517807883, now seen corresponding path program 2 times [2022-03-15 19:27:31,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:31,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327123281] [2022-03-15 19:27:31,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:31,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:27:31,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:31,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327123281] [2022-03-15 19:27:31,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327123281] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:27:31,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:27:31,373 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:27:31,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500788212] [2022-03-15 19:27:31,373 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:27:31,375 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:27:31,385 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 112 transitions. [2022-03-15 19:27:31,386 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:27:31,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [8707#(< 0 (mod ~A~0 4294967296)), 8706#(< (mod |thread1Thread1of1ForFork2_~i~0#1| 4294967296) (mod ~A~0 4294967296)), 8709#(<= (mod ~A~0 4294967296) 0), 8708#(<= (mod ~A~0 4294967296) (mod |thread2Thread1of1ForFork0_~i~1#1| 4294967296)), 8710#(= |thread1Thread1of1ForFork2_~i~0#1| 0)] [2022-03-15 19:27:31,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:27:31,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:27:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:27:31,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:27:31,742 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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:27:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:27:31,975 INFO L93 Difference]: Finished difference Result 109 states and 257 transitions. [2022-03-15 19:27:31,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:27:31,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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:27:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:27:31,975 INFO L225 Difference]: With dead ends: 109 [2022-03-15 19:27:31,975 INFO L226 Difference]: Without dead ends: 95 [2022-03-15 19:27:31,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:27:31,976 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:27:31,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:27:31,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-03-15 19:27:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-03-15 19:27:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.4361702127659575) internal successors, (229), 94 states have internal predecessors, (229), 0 states have call successors, (0), 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:27:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 229 transitions. [2022-03-15 19:27:31,978 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 229 transitions. Word has length 22 [2022-03-15 19:27:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:27:31,978 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 229 transitions. [2022-03-15 19:27:31,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 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:27:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 229 transitions. [2022-03-15 19:27:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:27:31,978 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:27:31,978 INFO L514 BasicCegarLoop]: trace histogram [2, 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:27:31,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-15 19:27:31,979 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 19:27:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:27:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1920179157, now seen corresponding path program 1 times [2022-03-15 19:27:31,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:27:31,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101682588] [2022-03-15 19:27:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:27:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:33,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:27:33,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101682588] [2022-03-15 19:27:33,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101682588] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:27:33,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855362697] [2022-03-15 19:27:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:27:33,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:27:33,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:27:33,404 INFO L229 MonitoredProcess]: Starting monitored process 16 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:27:33,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:27:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:27:33,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:27:33,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:27:33,936 INFO L353 Elim1Store]: treesize reduction 96, result has 6.8 percent of original size [2022-03-15 19:27:33,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 38 [2022-03-15 19:27:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:27:33,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:27:34,254 INFO L353 Elim1Store]: treesize reduction 47, result has 53.0 percent of original size [2022-03-15 19:27:34,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 76 Received shutdown request... [2022-03-15 19:40:54,820 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:40:54,832 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:40:54,833 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-15 19:40:54,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:40:54,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:55,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:55,040 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 10ms.. [2022-03-15 19:40:55,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 19:40:55,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 19:40:55,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 19:40:55,042 INFO L732 BasicCegarLoop]: Path program histogram: [14, 2, 1, 1, 1] [2022-03-15 19:40:55,067 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:40:55,067 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:40:55,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:40:55 BasicIcfg [2022-03-15 19:40:55,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:40:55,069 INFO L158 Benchmark]: Toolchain (without parser) took 861120.25ms. Allocated memory was 206.6MB in the beginning and 657.5MB in the end (delta: 450.9MB). Free memory was 151.7MB in the beginning and 616.5MB in the end (delta: -464.8MB). Peak memory consumption was 381.3MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,069 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory was 168.2MB in the beginning and 168.0MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:40:55,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.33ms. Allocated memory is still 206.6MB. Free memory was 151.5MB in the beginning and 175.4MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.90ms. Allocated memory is still 206.6MB. Free memory was 175.4MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,070 INFO L158 Benchmark]: Boogie Preprocessor took 16.43ms. Allocated memory is still 206.6MB. Free memory was 173.3MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,070 INFO L158 Benchmark]: RCFGBuilder took 398.15ms. Allocated memory is still 206.6MB. Free memory was 171.8MB in the beginning and 149.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,070 INFO L158 Benchmark]: TraceAbstraction took 860462.64ms. Allocated memory was 206.6MB in the beginning and 657.5MB in the end (delta: 450.9MB). Free memory was 149.1MB in the beginning and 616.5MB in the end (delta: -467.4MB). Peak memory consumption was 379.7MB. Max. memory is 8.0GB. [2022-03-15 19:40:55,071 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.09ms. Allocated memory is still 206.6MB. Free memory was 168.2MB in the beginning and 168.0MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.33ms. Allocated memory is still 206.6MB. Free memory was 151.5MB in the beginning and 175.4MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.90ms. Allocated memory is still 206.6MB. Free memory was 175.4MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.43ms. Allocated memory is still 206.6MB. Free memory was 173.3MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 398.15ms. Allocated memory is still 206.6MB. Free memory was 171.8MB in the beginning and 149.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 860462.64ms. Allocated memory was 206.6MB in the beginning and 657.5MB in the end (delta: 450.9MB). Free memory was 149.1MB in the beginning and 616.5MB in the end (delta: -467.4MB). Peak memory consumption was 379.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 155 PlacesBefore, 33 PlacesAfterwards, 154 TransitionsBefore, 26 TransitionsAfterwards, 1464 CoEnabledTransitionPairs, 7 FixpointIterations, 90 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 142 TotalNumberOfCompositions, 1614 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1343, positive: 1295, positive conditional: 0, positive unconditional: 1295, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 767, positive: 754, positive conditional: 0, positive unconditional: 754, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1343, positive: 541, positive conditional: 0, positive unconditional: 541, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 767, unknown conditional: 0, unknown unconditional: 767] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - 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: 110]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 10ms.. - TimeoutResultAtElement [Line: 102]: 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 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 10ms.. - TimeoutResultAtElement [Line: 103]: 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 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 10ms.. - TimeoutResultAtElement [Line: 104]: 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 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 12 for 10ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 180 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 860.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 365 IncrementalHoareTripleChecker+Unchecked, 2570 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6489 IncrementalHoareTripleChecker+Invalid, 7195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 0 mSDtfsCounter, 6489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 561 SyntacticMatches, 19 SemanticMatches, 462 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=8, InterpolantAutomatonStates: 202, 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, 18 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 672 NumberOfCodeBlocks, 660 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 800 ConstructedInterpolants, 25 QuantifiedInterpolants, 20689 SizeOfPredicates, 246 NumberOfNonLiveVariables, 3234 ConjunctsInSsa, 494 ConjunctsInUnsatCore, 40 InterpolantComputations, 14 PerfectInterpolantSequences, 51/116 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