/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-03 17:23:47,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-03 17:23:47,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-03 17:23:47,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-03 17:23:47,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-03 17:23:47,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-03 17:23:47,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-03 17:23:47,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-03 17:23:47,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-03 17:23:47,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-03 17:23:47,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-03 17:23:47,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-03 17:23:47,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-03 17:23:47,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-03 17:23:47,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-03 17:23:47,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-03 17:23:47,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-03 17:23:47,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-03 17:23:47,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-03 17:23:47,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-03 17:23:47,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-03 17:23:47,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-03 17:23:47,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-03 17:23:47,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-03 17:23:47,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-03 17:23:47,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-03 17:23:47,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-03 17:23:47,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-03 17:23:47,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-03 17:23:47,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-03 17:23:47,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-03 17:23:47,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-03 17:23:47,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-03 17:23:47,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-03 17:23:47,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-03 17:23:47,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-03 17:23:47,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-03 17:23:47,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-03 17:23:47,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-03 17:23:47,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-03 17:23:47,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-03 17:23:47,430 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-03 17:23:47,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-03 17:23:47,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-03 17:23:47,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-03 17:23:47,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-03 17:23:47,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-03 17:23:47,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-03 17:23:47,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-03 17:23:47,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-03 17:23:47,457 INFO L138 SettingsManager]: * Use SBE=true [2022-03-03 17:23:47,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-03 17:23:47,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-03 17:23:47,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:23:47,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-03 17:23:47,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-03 17:23:47,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-03 17:23:47,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-03 17:23:47,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-03 17:23:47,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-03 17:23:47,647 INFO L275 PluginConnector]: CDTParser initialized [2022-03-03 17:23:47,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-03 17:23:47,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0d5e220/bd2a034d24b545fe80efcd9aad30b442/FLAG5b3895c1e [2022-03-03 17:23:48,100 INFO L306 CDTParser]: Found 1 translation units. [2022-03-03 17:23:48,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c [2022-03-03 17:23:48,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0d5e220/bd2a034d24b545fe80efcd9aad30b442/FLAG5b3895c1e [2022-03-03 17:23:48,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b0d5e220/bd2a034d24b545fe80efcd9aad30b442 [2022-03-03 17:23:48,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-03 17:23:48,128 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-03 17:23:48,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-03 17:23:48,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-03 17:23:48,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-03 17:23:48,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e76e1af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48, skipping insertion in model container [2022-03-03 17:23:48,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-03 17:23:48,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-03 17:23:48,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-03-03 17:23:48,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:23:48,295 INFO L203 MainTranslator]: Completed pre-run [2022-03-03 17:23:48,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt.wvr.c[2761,2774] [2022-03-03 17:23:48,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-03 17:23:48,332 INFO L208 MainTranslator]: Completed translation [2022-03-03 17:23:48,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48 WrapperNode [2022-03-03 17:23:48,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-03 17:23:48,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-03 17:23:48,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-03 17:23:48,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-03 17:23:48,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,366 INFO L137 Inliner]: procedures = 25, calls = 51, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 200 [2022-03-03 17:23:48,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-03 17:23:48,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-03 17:23:48,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-03 17:23:48,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-03 17:23:48,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-03 17:23:48,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-03 17:23:48,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-03 17:23:48,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-03 17:23:48,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (1/1) ... [2022-03-03 17:23:48,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-03 17:23:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:48,419 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-03 17:23:48,426 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-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-03 17:23:48,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-03 17:23:48,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-03 17:23:48,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-03 17:23:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-03 17:23:48,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-03 17:23:48,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-03 17:23:48,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-03 17:23:48,452 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-03 17:23:48,533 INFO L234 CfgBuilder]: Building ICFG [2022-03-03 17:23:48,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-03 17:23:48,766 INFO L275 CfgBuilder]: Performing block encoding [2022-03-03 17:23:48,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-03 17:23:48,885 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-03 17:23:48,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:23:48 BoogieIcfgContainer [2022-03-03 17:23:48,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-03 17:23:48,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-03 17:23:48,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-03 17:23:48,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-03 17:23:48,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:23:48" (1/3) ... [2022-03-03 17:23:48,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2540721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:23:48, skipping insertion in model container [2022-03-03 17:23:48,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:23:48" (2/3) ... [2022-03-03 17:23:48,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2540721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:23:48, skipping insertion in model container [2022-03-03 17:23:48,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.03 05:23:48" (3/3) ... [2022-03-03 17:23:48,892 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2022-03-03 17:23:48,895 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-03 17:23:48,895 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-03 17:23:48,896 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-03 17:23:48,896 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-03 17:23:48,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,931 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,932 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,935 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,936 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,937 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,938 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,939 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,941 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,942 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,942 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,942 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,942 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,942 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,943 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,944 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,945 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,946 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,947 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,949 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,949 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,949 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,949 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,949 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,950 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,962 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,963 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,964 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,965 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,966 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~i~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~tmp~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,967 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-03 17:23:48,970 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-03 17:23:49,022 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-03 17:23:49,038 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-03 17:23:49,039 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-03 17:23:49,047 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 156 transitions, 336 flow [2022-03-03 17:23:49,261 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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-03 17:23:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 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-03 17:23:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 17:23:49,315 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:49,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:49,317 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-03 17:23:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash -131448580, now seen corresponding path program 1 times [2022-03-03 17:23:49,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:49,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298801952] [2022-03-03 17:23:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:49,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:49,544 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-03 17:23:49,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:49,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298801952] [2022-03-03 17:23:49,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298801952] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:23:49,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:23:49,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-03 17:23:49,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680246691] [2022-03-03 17:23:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:49,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-03 17:23:49,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-03 17:23:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:23:49,594 INFO L87 Difference]: Start difference. First operand has 5072 states, 5071 states have (on average 3.8171958193650166) internal successors, (19357), 5071 states have internal predecessors, (19357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-03 17:23:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:49,705 INFO L93 Difference]: Finished difference Result 5072 states and 17963 transitions. [2022-03-03 17:23:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-03 17:23:49,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-03-03 17:23:49,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:49,751 INFO L225 Difference]: With dead ends: 5072 [2022-03-03 17:23:49,751 INFO L226 Difference]: Without dead ends: 5068 [2022-03-03 17:23:49,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-03 17:23:49,756 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:49,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:23:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2022-03-03 17:23:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 5068. [2022-03-03 17:23:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5067 states have (on average 3.544306295638445) internal successors, (17959), 5067 states have internal predecessors, (17959), 0 states have call successors, (0), 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-03 17:23:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 17959 transitions. [2022-03-03 17:23:50,010 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 17959 transitions. Word has length 105 [2022-03-03 17:23:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:50,011 INFO L470 AbstractCegarLoop]: Abstraction has 5068 states and 17959 transitions. [2022-03-03 17:23:50,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-03 17:23:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 17959 transitions. [2022-03-03 17:23:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-03-03 17:23:50,025 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:50,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:50,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-03 17:23:50,025 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-03 17:23:50,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:50,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1737784380, now seen corresponding path program 1 times [2022-03-03 17:23:50,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:50,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199205756] [2022-03-03 17:23:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:50,335 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-03 17:23:50,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:50,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199205756] [2022-03-03 17:23:50,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199205756] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:23:50,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:23:50,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-03 17:23:50,336 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340780808] [2022-03-03 17:23:50,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:50,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-03 17:23:50,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:50,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-03 17:23:50,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-03 17:23:50,337 INFO L87 Difference]: Start difference. First operand 5068 states and 17959 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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-03 17:23:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:50,554 INFO L93 Difference]: Finished difference Result 9970 states and 35356 transitions. [2022-03-03 17:23:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-03 17:23:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2022-03-03 17:23:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:50,643 INFO L225 Difference]: With dead ends: 9970 [2022-03-03 17:23:50,644 INFO L226 Difference]: Without dead ends: 9820 [2022-03-03 17:23:50,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-03 17:23:50,646 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 174 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:50,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 477 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:23:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9820 states. [2022-03-03 17:23:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9820 to 5678. [2022-03-03 17:23:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 5677 states have (on average 3.5317949621278846) internal successors, (20050), 5677 states have internal predecessors, (20050), 0 states have call successors, (0), 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-03 17:23:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 20050 transitions. [2022-03-03 17:23:50,887 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 20050 transitions. Word has length 105 [2022-03-03 17:23:50,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:50,889 INFO L470 AbstractCegarLoop]: Abstraction has 5678 states and 20050 transitions. [2022-03-03 17:23:50,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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-03 17:23:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 20050 transitions. [2022-03-03 17:23:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-03 17:23:50,907 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:50,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:50,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-03 17:23:50,908 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-03 17:23:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -957278848, now seen corresponding path program 1 times [2022-03-03 17:23:50,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:50,909 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103517534] [2022-03-03 17:23:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:23:51,087 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:51,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103517534] [2022-03-03 17:23:51,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103517534] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:23:51,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:23:51,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 17:23:51,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608970644] [2022-03-03 17:23:51,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:51,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 17:23:51,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 17:23:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-03 17:23:51,089 INFO L87 Difference]: Start difference. First operand 5678 states and 20050 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:51,438 INFO L93 Difference]: Finished difference Result 8818 states and 30445 transitions. [2022-03-03 17:23:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-03 17:23:51,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-03-03 17:23:51,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:51,476 INFO L225 Difference]: With dead ends: 8818 [2022-03-03 17:23:51,476 INFO L226 Difference]: Without dead ends: 8728 [2022-03-03 17:23:51,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:23:51,477 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 554 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:51,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 675 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:23:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2022-03-03 17:23:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 6938. [2022-03-03 17:23:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6938 states, 6937 states have (on average 3.5180913939743403) internal successors, (24405), 6937 states have internal predecessors, (24405), 0 states have call successors, (0), 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-03 17:23:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 24405 transitions. [2022-03-03 17:23:51,682 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 24405 transitions. Word has length 111 [2022-03-03 17:23:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:51,682 INFO L470 AbstractCegarLoop]: Abstraction has 6938 states and 24405 transitions. [2022-03-03 17:23:51,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 24405 transitions. [2022-03-03 17:23:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-03 17:23:51,701 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:51,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:51,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-03 17:23:51,701 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-03 17:23:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1189826400, now seen corresponding path program 1 times [2022-03-03 17:23:51,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:51,702 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959048896] [2022-03-03 17:23:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:23:51,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:51,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959048896] [2022-03-03 17:23:51,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959048896] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:23:51,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:23:51,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-03 17:23:51,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345742238] [2022-03-03 17:23:51,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:51,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-03 17:23:51,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-03 17:23:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-03-03 17:23:51,921 INFO L87 Difference]: Start difference. First operand 6938 states and 24405 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:52,353 INFO L93 Difference]: Finished difference Result 7558 states and 25776 transitions. [2022-03-03 17:23:52,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 17:23:52,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-03-03 17:23:52,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:52,381 INFO L225 Difference]: With dead ends: 7558 [2022-03-03 17:23:52,383 INFO L226 Difference]: Without dead ends: 7294 [2022-03-03 17:23:52,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-03-03 17:23:52,390 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 564 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:52,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 635 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:23:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7294 states. [2022-03-03 17:23:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7294 to 6848. [2022-03-03 17:23:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6847 states have (on average 3.465897473345991) internal successors, (23731), 6847 states have internal predecessors, (23731), 0 states have call successors, (0), 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-03 17:23:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 23731 transitions. [2022-03-03 17:23:52,582 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 23731 transitions. Word has length 111 [2022-03-03 17:23:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:52,582 INFO L470 AbstractCegarLoop]: Abstraction has 6848 states and 23731 transitions. [2022-03-03 17:23:52,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 23731 transitions. [2022-03-03 17:23:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-03-03 17:23:52,599 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:52,599 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:52,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-03 17:23:52,599 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-03 17:23:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 318459928, now seen corresponding path program 1 times [2022-03-03 17:23:52,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:52,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58460910] [2022-03-03 17:23:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:23:52,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:52,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58460910] [2022-03-03 17:23:52,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58460910] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-03 17:23:52,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-03 17:23:52,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-03 17:23:52,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512241176] [2022-03-03 17:23:52,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:52,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:23:52,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:52,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:23:52,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-03 17:23:52,691 INFO L87 Difference]: Start difference. First operand 6848 states and 23731 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:52,833 INFO L93 Difference]: Finished difference Result 5971 states and 20798 transitions. [2022-03-03 17:23:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-03 17:23:52,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-03-03 17:23:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:52,852 INFO L225 Difference]: With dead ends: 5971 [2022-03-03 17:23:52,852 INFO L226 Difference]: Without dead ends: 5684 [2022-03-03 17:23:52,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-03-03 17:23:52,853 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 379 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:52,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 393 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:23:52,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5684 states. [2022-03-03 17:23:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5684 to 5679. [2022-03-03 17:23:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 3.5313490665727367) internal successors, (20051), 5678 states have internal predecessors, (20051), 0 states have call successors, (0), 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-03 17:23:52,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 20051 transitions. [2022-03-03 17:23:52,976 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 20051 transitions. Word has length 111 [2022-03-03 17:23:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:52,976 INFO L470 AbstractCegarLoop]: Abstraction has 5679 states and 20051 transitions. [2022-03-03 17:23:52,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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-03 17:23:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 20051 transitions. [2022-03-03 17:23:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:23:52,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:52,988 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:52,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-03 17:23:52,988 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-03 17:23:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1466674770, now seen corresponding path program 1 times [2022-03-03 17:23:52,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:52,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544786645] [2022-03-03 17:23:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:53,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:53,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544786645] [2022-03-03 17:23:53,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544786645] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:53,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978040269] [2022-03-03 17:23:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:53,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:53,047 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-03 17:23:53,053 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-03 17:23:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:53,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:23:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:23:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:53,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:23:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:53,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978040269] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:53,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:23:53,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-03-03 17:23:53,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381063839] [2022-03-03 17:23:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:53,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-03 17:23:53,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:53,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-03 17:23:53,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-03-03 17:23:53,590 INFO L87 Difference]: Start difference. First operand 5679 states and 20051 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:23:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:53,679 INFO L93 Difference]: Finished difference Result 5775 states and 20516 transitions. [2022-03-03 17:23:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-03 17:23:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-03 17:23:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:53,699 INFO L225 Difference]: With dead ends: 5775 [2022-03-03 17:23:53,699 INFO L226 Difference]: Without dead ends: 5775 [2022-03-03 17:23:53,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-03-03 17:23:53,700 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 248 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:53,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 335 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-03 17:23:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-03-03 17:23:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5535. [2022-03-03 17:23:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5535 states, 5534 states have (on average 3.5511384170581857) internal successors, (19652), 5534 states have internal predecessors, (19652), 0 states have call successors, (0), 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-03 17:23:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 19652 transitions. [2022-03-03 17:23:53,850 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 19652 transitions. Word has length 118 [2022-03-03 17:23:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:53,850 INFO L470 AbstractCegarLoop]: Abstraction has 5535 states and 19652 transitions. [2022-03-03 17:23:53,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:23:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 19652 transitions. [2022-03-03 17:23:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:23:53,862 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:53,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:53,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-03 17:23:54,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-03 17:23:54,076 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-03 17:23:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -190935994, now seen corresponding path program 1 times [2022-03-03 17:23:54,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:54,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465792187] [2022-03-03 17:23:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:54,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:54,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465792187] [2022-03-03 17:23:54,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465792187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:54,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807700023] [2022-03-03 17:23:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:54,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:54,149 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-03 17:23:54,150 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-03 17:23:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:54,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:23:54,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:23:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:54,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:23:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:54,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807700023] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:54,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:23:54,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-03-03 17:23:54,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401017841] [2022-03-03 17:23:54,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:54,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:23:54,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:54,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:23:54,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-03 17:23:54,664 INFO L87 Difference]: Start difference. First operand 5535 states and 19652 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:23:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:54,851 INFO L93 Difference]: Finished difference Result 7577 states and 27120 transitions. [2022-03-03 17:23:54,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 17:23:54,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-03 17:23:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:54,875 INFO L225 Difference]: With dead ends: 7577 [2022-03-03 17:23:54,875 INFO L226 Difference]: Without dead ends: 7577 [2022-03-03 17:23:54,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 226 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2022-03-03 17:23:54,876 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 373 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:54,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:23:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7577 states. [2022-03-03 17:23:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7577 to 5864. [2022-03-03 17:23:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5864 states, 5863 states have (on average 3.551594746716698) internal successors, (20823), 5863 states have internal predecessors, (20823), 0 states have call successors, (0), 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-03 17:23:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 20823 transitions. [2022-03-03 17:23:55,010 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 20823 transitions. Word has length 118 [2022-03-03 17:23:55,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:55,011 INFO L470 AbstractCegarLoop]: Abstraction has 5864 states and 20823 transitions. [2022-03-03 17:23:55,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:23:55,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 20823 transitions. [2022-03-03 17:23:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:23:55,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:55,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:55,073 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-03 17:23:55,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-03-03 17:23:55,261 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-03 17:23:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1391695046, now seen corresponding path program 2 times [2022-03-03 17:23:55,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:55,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509496409] [2022-03-03 17:23:55,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:55,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:55,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:55,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509496409] [2022-03-03 17:23:55,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509496409] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:55,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785178102] [2022-03-03 17:23:55,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:23:55,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:55,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:55,362 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-03 17:23:55,363 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-03 17:23:55,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:23:55,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:23:55,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:23:55,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:23:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:55,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:23:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:55,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785178102] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:23:55,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:23:55,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2022-03-03 17:23:55,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627174453] [2022-03-03 17:23:55,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:23:55,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-03 17:23:55,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-03 17:23:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-03-03 17:23:55,802 INFO L87 Difference]: Start difference. First operand 5864 states and 20823 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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-03 17:23:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:56,722 INFO L93 Difference]: Finished difference Result 26682 states and 97534 transitions. [2022-03-03 17:23:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-03-03 17:23:56,723 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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 118 [2022-03-03 17:23:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:56,817 INFO L225 Difference]: With dead ends: 26682 [2022-03-03 17:23:56,817 INFO L226 Difference]: Without dead ends: 26682 [2022-03-03 17:23:56,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=570, Invalid=1686, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 17:23:56,818 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1077 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:56,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1077 Valid, 1713 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 17:23:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2022-03-03 17:23:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 5911. [2022-03-03 17:23:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5911 states, 5910 states have (on average 3.5686971235194584) internal successors, (21091), 5910 states have internal predecessors, (21091), 0 states have call successors, (0), 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-03 17:23:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5911 states to 5911 states and 21091 transitions. [2022-03-03 17:23:57,189 INFO L78 Accepts]: Start accepts. Automaton has 5911 states and 21091 transitions. Word has length 118 [2022-03-03 17:23:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:57,190 INFO L470 AbstractCegarLoop]: Abstraction has 5911 states and 21091 transitions. [2022-03-03 17:23:57,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 0 states have call successors, (0), 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-03 17:23:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5911 states and 21091 transitions. [2022-03-03 17:23:57,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:23:57,202 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:57,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:57,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-03 17:23:57,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:57,410 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-03 17:23:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:57,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1570091000, now seen corresponding path program 3 times [2022-03-03 17:23:57,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:57,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681581326] [2022-03-03 17:23:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:57,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:57,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:57,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681581326] [2022-03-03 17:23:57,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681581326] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:57,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468301752] [2022-03-03 17:23:57,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:23:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:57,492 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-03 17:23:57,493 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-03 17:23:57,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:23:57,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:23:57,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:23:57,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:23:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:57,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:23:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:57,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468301752] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:23:57,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:23:57,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-03 17:23:57,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942425000] [2022-03-03 17:23:57,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:23:57,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:23:57,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:23:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:23:57,947 INFO L87 Difference]: Start difference. First operand 5911 states and 21091 transitions. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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-03 17:23:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:23:58,678 INFO L93 Difference]: Finished difference Result 18477 states and 67462 transitions. [2022-03-03 17:23:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-03 17:23:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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 118 [2022-03-03 17:23:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:23:58,740 INFO L225 Difference]: With dead ends: 18477 [2022-03-03 17:23:58,740 INFO L226 Difference]: Without dead ends: 18477 [2022-03-03 17:23:58,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2022-03-03 17:23:58,743 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 752 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:23:58,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 1606 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 17:23:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18477 states. [2022-03-03 17:23:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18477 to 6055. [2022-03-03 17:23:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 3.5632639577139082) internal successors, (21572), 6054 states have internal predecessors, (21572), 0 states have call successors, (0), 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-03 17:23:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 21572 transitions. [2022-03-03 17:23:59,079 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 21572 transitions. Word has length 118 [2022-03-03 17:23:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:23:59,079 INFO L470 AbstractCegarLoop]: Abstraction has 6055 states and 21572 transitions. [2022-03-03 17:23:59,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 0 states have call successors, (0), 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-03 17:23:59,079 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 21572 transitions. [2022-03-03 17:23:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:23:59,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:23:59,091 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:23:59,110 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-03 17:23:59,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:59,307 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-03 17:23:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:23:59,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1015378234, now seen corresponding path program 4 times [2022-03-03 17:23:59,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:23:59,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663657636] [2022-03-03 17:23:59,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:23:59,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:23:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:23:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:59,379 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:23:59,379 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663657636] [2022-03-03 17:23:59,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663657636] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:59,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237918174] [2022-03-03 17:23:59,380 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:23:59,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:23:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:23:59,381 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-03 17:23:59,382 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-03 17:23:59,452 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:23:59,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:23:59,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-03 17:23:59,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:23:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:59,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:23:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:23:59,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237918174] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-03 17:23:59,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-03 17:23:59,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2022-03-03 17:23:59,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603187373] [2022-03-03 17:23:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-03 17:23:59,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-03 17:23:59,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:23:59,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-03 17:23:59,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-03 17:23:59,911 INFO L87 Difference]: Start difference. First operand 6055 states and 21572 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:24:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:00,155 INFO L93 Difference]: Finished difference Result 12871 states and 46133 transitions. [2022-03-03 17:24:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-03 17:24:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2022-03-03 17:24:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:00,192 INFO L225 Difference]: With dead ends: 12871 [2022-03-03 17:24:00,192 INFO L226 Difference]: Without dead ends: 12871 [2022-03-03 17:24:00,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-03-03 17:24:00,193 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 391 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:00,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 734 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-03 17:24:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2022-03-03 17:24:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 6215. [2022-03-03 17:24:00,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6215 states, 6214 states have (on average 3.5926939169616996) internal successors, (22325), 6214 states have internal predecessors, (22325), 0 states have call successors, (0), 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-03 17:24:00,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6215 states to 6215 states and 22325 transitions. [2022-03-03 17:24:00,382 INFO L78 Accepts]: Start accepts. Automaton has 6215 states and 22325 transitions. Word has length 118 [2022-03-03 17:24:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:00,382 INFO L470 AbstractCegarLoop]: Abstraction has 6215 states and 22325 transitions. [2022-03-03 17:24:00,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-03 17:24:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6215 states and 22325 transitions. [2022-03-03 17:24:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:24:00,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:00,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:00,416 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-03 17:24:00,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-03 17:24:00,613 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-03 17:24:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:00,613 INFO L85 PathProgramCache]: Analyzing trace with hash -836982280, now seen corresponding path program 5 times [2022-03-03 17:24:00,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:00,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835623667] [2022-03-03 17:24:00,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:00,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:00,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:00,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835623667] [2022-03-03 17:24:00,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835623667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:00,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384680125] [2022-03-03 17:24:00,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:24:00,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:00,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:00,690 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-03 17:24:00,691 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-03 17:24:00,769 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:24:00,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:00,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:24:00,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:00,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:01,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384680125] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:01,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:01,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-03 17:24:01,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428921031] [2022-03-03 17:24:01,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:01,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-03 17:24:01,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:01,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-03 17:24:01,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-03-03 17:24:01,135 INFO L87 Difference]: Start difference. First operand 6215 states and 22325 transitions. Second operand has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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-03 17:24:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:02,074 INFO L93 Difference]: Finished difference Result 22956 states and 82999 transitions. [2022-03-03 17:24:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-03 17:24:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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 118 [2022-03-03 17:24:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:02,137 INFO L225 Difference]: With dead ends: 22956 [2022-03-03 17:24:02,137 INFO L226 Difference]: Without dead ends: 22956 [2022-03-03 17:24:02,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=1076, Unknown=0, NotChecked=0, Total=1482 [2022-03-03 17:24:02,138 INFO L933 BasicCegarLoop]: 294 mSDtfsCounter, 722 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:02,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [722 Valid, 2690 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 17:24:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22956 states. [2022-03-03 17:24:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22956 to 6168. [2022-03-03 17:24:02,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6168 states, 6167 states have (on average 3.5766174801362087) internal successors, (22057), 6167 states have internal predecessors, (22057), 0 states have call successors, (0), 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-03 17:24:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 22057 transitions. [2022-03-03 17:24:02,460 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 22057 transitions. Word has length 118 [2022-03-03 17:24:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:02,460 INFO L470 AbstractCegarLoop]: Abstraction has 6168 states and 22057 transitions. [2022-03-03 17:24:02,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.25) internal successors, (180), 16 states have internal predecessors, (180), 0 states have call successors, (0), 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-03 17:24:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 22057 transitions. [2022-03-03 17:24:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-03-03 17:24:02,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:02,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:02,490 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-03 17:24:02,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:02,690 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-03 17:24:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1449163496, now seen corresponding path program 6 times [2022-03-03 17:24:02,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:02,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138731012] [2022-03-03 17:24:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:02,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:02,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:02,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138731012] [2022-03-03 17:24:02,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138731012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:02,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826702997] [2022-03-03 17:24:02,764 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:24:02,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:02,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:02,765 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-03 17:24:02,773 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-03 17:24:02,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-03 17:24:02,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:02,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-03 17:24:02,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:03,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-03 17:24:03,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826702997] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:03,183 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:03,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-03-03 17:24:03,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713210015] [2022-03-03 17:24:03,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:03,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-03 17:24:03,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-03 17:24:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-03-03 17:24:03,186 INFO L87 Difference]: Start difference. First operand 6168 states and 22057 transitions. Second operand has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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-03 17:24:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:03,767 INFO L93 Difference]: Finished difference Result 14859 states and 53179 transitions. [2022-03-03 17:24:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-03 17:24:03,767 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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 118 [2022-03-03 17:24:03,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:03,807 INFO L225 Difference]: With dead ends: 14859 [2022-03-03 17:24:03,808 INFO L226 Difference]: Without dead ends: 14859 [2022-03-03 17:24:03,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2022-03-03 17:24:03,808 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 535 mSDsluCounter, 1668 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:03,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1835 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-03 17:24:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14859 states. [2022-03-03 17:24:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14859 to 6510. [2022-03-03 17:24:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.5437087110155168) internal successors, (23066), 6509 states have internal predecessors, (23066), 0 states have call successors, (0), 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-03 17:24:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23066 transitions. [2022-03-03 17:24:03,995 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 23066 transitions. Word has length 118 [2022-03-03 17:24:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:03,995 INFO L470 AbstractCegarLoop]: Abstraction has 6510 states and 23066 transitions. [2022-03-03 17:24:03,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.933333333333334) internal successors, (179), 15 states have internal predecessors, (179), 0 states have call successors, (0), 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-03 17:24:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 23066 transitions. [2022-03-03 17:24:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:04,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:04,007 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:04,024 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-03 17:24:04,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:04,226 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-03 17:24:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:04,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1496151562, now seen corresponding path program 1 times [2022-03-03 17:24:04,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:04,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374611593] [2022-03-03 17:24:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:04,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:04,632 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-03 17:24:04,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:04,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374611593] [2022-03-03 17:24:04,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374611593] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:04,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810667634] [2022-03-03 17:24:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:04,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:04,634 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-03 17:24:04,635 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-03 17:24:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:04,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 71 conjunts are in the unsatisfiable core [2022-03-03 17:24:04,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:04,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:24:04,837 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:24:04,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:24:05,142 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:24:05,142 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 15 treesize of output 15 [2022-03-03 17:24:05,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:24:05,560 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-03 17:24:05,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:24:05,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:05,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:24:05,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 17:24:06,060 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-03 17:24:06,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:06,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int))) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-03 17:24:06,228 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-03 17:24:06,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0) 0)) is different from false [2022-03-03 17:24:06,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-03 17:24:06,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) c_~res2~0 (* (- 1) c_~res1~0)))) is different from false [2022-03-03 17:24:06,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:06,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:06,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:06,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array Int Int)) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_332 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_331))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_332) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (* (- 1) c_~res1~0))))) is different from false [2022-03-03 17:24:06,423 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:06,424 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 55 treesize of output 44 [2022-03-03 17:24:06,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-03-03 17:24:06,436 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 726 treesize of output 710 [2022-03-03 17:24:06,443 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 710 treesize of output 678 [2022-03-03 17:24:06,448 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 678 treesize of output 646 [2022-03-03 17:24:08,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:24:08,866 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 10 treesize of output 8 [2022-03-03 17:24:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-03 17:24:08,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810667634] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:08,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:08,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 22] total 54 [2022-03-03 17:24:08,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73677051] [2022-03-03 17:24:08,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:08,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-03 17:24:08,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-03 17:24:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1797, Unknown=9, NotChecked=846, Total=2862 [2022-03-03 17:24:08,890 INFO L87 Difference]: Start difference. First operand 6510 states and 23066 transitions. Second operand has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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-03 17:24:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:11,563 INFO L93 Difference]: Finished difference Result 18697 states and 66840 transitions. [2022-03-03 17:24:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-03 17:24:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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 124 [2022-03-03 17:24:11,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:11,609 INFO L225 Difference]: With dead ends: 18697 [2022-03-03 17:24:11,609 INFO L226 Difference]: Without dead ends: 18547 [2022-03-03 17:24:11,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 216 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=721, Invalid=5006, Unknown=9, NotChecked=1404, Total=7140 [2022-03-03 17:24:11,611 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 1843 mSDsluCounter, 5395 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 5219 SdHoareTripleChecker+Invalid, 6844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4676 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:11,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1843 Valid, 5219 Invalid, 6844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2097 Invalid, 0 Unknown, 4676 Unchecked, 0.9s Time] [2022-03-03 17:24:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18547 states. [2022-03-03 17:24:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18547 to 9408. [2022-03-03 17:24:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9408 states, 9407 states have (on average 3.5748910385882855) internal successors, (33629), 9407 states have internal predecessors, (33629), 0 states have call successors, (0), 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-03 17:24:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9408 states to 9408 states and 33629 transitions. [2022-03-03 17:24:11,858 INFO L78 Accepts]: Start accepts. Automaton has 9408 states and 33629 transitions. Word has length 124 [2022-03-03 17:24:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:11,858 INFO L470 AbstractCegarLoop]: Abstraction has 9408 states and 33629 transitions. [2022-03-03 17:24:11,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.537037037037037) internal successors, (299), 54 states have internal predecessors, (299), 0 states have call successors, (0), 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-03 17:24:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 9408 states and 33629 transitions. [2022-03-03 17:24:11,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:11,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:11,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:11,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-03 17:24:12,074 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,SelfDestructingSolverStorable12 [2022-03-03 17:24:12,075 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-03 17:24:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1263604010, now seen corresponding path program 1 times [2022-03-03 17:24:12,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:12,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060739721] [2022-03-03 17:24:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:12,828 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-03 17:24:12,828 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:12,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060739721] [2022-03-03 17:24:12,828 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060739721] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:12,828 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675209002] [2022-03-03 17:24:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:12,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:12,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:12,830 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-03 17:24:12,831 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-03 17:24:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:12,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-03-03 17:24:12,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:12,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:24:13,031 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:24:13,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:24:13,453 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:24:13,454 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 15 treesize of output 15 [2022-03-03 17:24:13,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:24:14,364 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-03 17:24:14,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:24:14,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:14,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-03-03 17:24:15,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:24:15,113 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:15,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-03-03 17:24:15,175 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-03 17:24:15,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:16,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:16,895 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 55 treesize of output 44 [2022-03-03 17:24:16,909 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:16,910 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 830 treesize of output 746 [2022-03-03 17:24:16,916 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 734 treesize of output 638 [2022-03-03 17:24:16,922 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 638 treesize of output 590 [2022-03-03 17:24:16,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:16,935 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 590 treesize of output 546 [2022-03-03 17:24:19,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:24:19,047 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 10 treesize of output 8 [2022-03-03 17:24:19,071 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-03 17:24:19,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675209002] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:19,071 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:19,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 32] total 83 [2022-03-03 17:24:19,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347362821] [2022-03-03 17:24:19,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:19,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-03 17:24:19,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:19,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-03 17:24:19,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=6205, Unknown=86, NotChecked=0, Total=6806 [2022-03-03 17:24:19,074 INFO L87 Difference]: Start difference. First operand 9408 states and 33629 transitions. Second operand has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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-03 17:24:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:26,255 INFO L93 Difference]: Finished difference Result 36669 states and 132152 transitions. [2022-03-03 17:24:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-03 17:24:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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 124 [2022-03-03 17:24:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:26,367 INFO L225 Difference]: With dead ends: 36669 [2022-03-03 17:24:26,367 INFO L226 Difference]: Without dead ends: 36369 [2022-03-03 17:24:26,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5979 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2297, Invalid=17923, Unknown=86, NotChecked=0, Total=20306 [2022-03-03 17:24:26,371 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 3085 mSDsluCounter, 10575 mSDsCounter, 0 mSdLazyCounter, 5191 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3085 SdHoareTripleChecker+Valid, 9796 SdHoareTripleChecker+Invalid, 9284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 5191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3982 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:26,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3085 Valid, 9796 Invalid, 9284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 5191 Invalid, 0 Unknown, 3982 Unchecked, 2.1s Time] [2022-03-03 17:24:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36369 states. [2022-03-03 17:24:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36369 to 11810. [2022-03-03 17:24:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11810 states, 11809 states have (on average 3.587009907697519) internal successors, (42359), 11809 states have internal predecessors, (42359), 0 states have call successors, (0), 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-03 17:24:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11810 states to 11810 states and 42359 transitions. [2022-03-03 17:24:26,826 INFO L78 Accepts]: Start accepts. Automaton has 11810 states and 42359 transitions. Word has length 124 [2022-03-03 17:24:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:26,826 INFO L470 AbstractCegarLoop]: Abstraction has 11810 states and 42359 transitions. [2022-03-03 17:24:26,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.63855421686747) internal successors, (302), 83 states have internal predecessors, (302), 0 states have call successors, (0), 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-03 17:24:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 11810 states and 42359 transitions. [2022-03-03 17:24:26,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:26,847 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:26,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:26,863 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-03 17:24:27,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-03 17:24:27,048 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-03 17:24:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1665569678, now seen corresponding path program 2 times [2022-03-03 17:24:27,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:27,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715488943] [2022-03-03 17:24:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:27,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:27,417 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-03 17:24:27,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:27,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715488943] [2022-03-03 17:24:27,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715488943] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:27,418 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401695648] [2022-03-03 17:24:27,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:24:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:27,419 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-03 17:24:27,419 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-03 17:24:27,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:24:27,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:27,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:24:27,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:28,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:28,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:28,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:28,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:28,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-03 17:24:28,402 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-03 17:24:28,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:28,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_406 (Array Int Int))) (= 0 (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)))) is different from false [2022-03-03 17:24:28,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (+ (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_406) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-03 17:24:28,555 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:28,555 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 116 treesize of output 92 [2022-03-03 17:24:28,558 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 80 treesize of output 76 [2022-03-03 17:24:28,561 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 38 treesize of output 36 [2022-03-03 17:24:29,050 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-03 17:24:29,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401695648] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:29,050 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:29,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-03-03 17:24:29,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214484241] [2022-03-03 17:24:29,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:29,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-03 17:24:29,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:29,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-03 17:24:29,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-03-03 17:24:29,052 INFO L87 Difference]: Start difference. First operand 11810 states and 42359 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:24:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:30,853 INFO L93 Difference]: Finished difference Result 32338 states and 116389 transitions. [2022-03-03 17:24:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-03 17:24:30,853 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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 124 [2022-03-03 17:24:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:30,953 INFO L225 Difference]: With dead ends: 32338 [2022-03-03 17:24:30,953 INFO L226 Difference]: Without dead ends: 32188 [2022-03-03 17:24:30,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 222 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=643, Invalid=4913, Unknown=2, NotChecked=294, Total=5852 [2022-03-03 17:24:30,954 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1559 mSDsluCounter, 4904 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 4807 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1009 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:30,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 4807 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2056 Invalid, 0 Unknown, 1009 Unchecked, 0.7s Time] [2022-03-03 17:24:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32188 states. [2022-03-03 17:24:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32188 to 12232. [2022-03-03 17:24:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12232 states, 12231 states have (on average 3.5917749979560134) internal successors, (43931), 12231 states have internal predecessors, (43931), 0 states have call successors, (0), 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-03 17:24:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12232 states to 12232 states and 43931 transitions. [2022-03-03 17:24:31,329 INFO L78 Accepts]: Start accepts. Automaton has 12232 states and 43931 transitions. Word has length 124 [2022-03-03 17:24:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:31,330 INFO L470 AbstractCegarLoop]: Abstraction has 12232 states and 43931 transitions. [2022-03-03 17:24:31,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:24:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 12232 states and 43931 transitions. [2022-03-03 17:24:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:31,353 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:31,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:31,371 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-03 17:24:31,563 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,SelfDestructingSolverStorable14 [2022-03-03 17:24:31,563 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-03 17:24:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2065216558, now seen corresponding path program 3 times [2022-03-03 17:24:31,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:31,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680623742] [2022-03-03 17:24:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:31,910 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-03 17:24:31,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:31,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680623742] [2022-03-03 17:24:31,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680623742] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:31,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676210114] [2022-03-03 17:24:31,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:24:31,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:31,912 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-03 17:24:31,913 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-03 17:24:32,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:24:32,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:32,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:24:32,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:32,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:32,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:32,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:32,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:32,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-03 17:24:32,952 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-03 17:24:32,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:33,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (+ (* (- 1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-03 17:24:33,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_~tmp~0#1| (* (- 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res2~0)) 0)) is different from false [2022-03-03 17:24:33,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:33,096 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 116 treesize of output 92 [2022-03-03 17:24:33,099 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 40 treesize of output 38 [2022-03-03 17:24:33,101 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 78 treesize of output 74 [2022-03-03 17:24:33,588 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-03 17:24:33,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676210114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:33,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:33,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 46 [2022-03-03 17:24:33,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134032063] [2022-03-03 17:24:33,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:33,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-03 17:24:33,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-03 17:24:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1701, Unknown=2, NotChecked=170, Total=2070 [2022-03-03 17:24:33,590 INFO L87 Difference]: Start difference. First operand 12232 states and 43931 transitions. Second operand has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:24:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:35,430 INFO L93 Difference]: Finished difference Result 37903 states and 136252 transitions. [2022-03-03 17:24:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-03 17:24:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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 124 [2022-03-03 17:24:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:35,544 INFO L225 Difference]: With dead ends: 37903 [2022-03-03 17:24:35,545 INFO L226 Difference]: Without dead ends: 37603 [2022-03-03 17:24:35,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=739, Invalid=5429, Unknown=2, NotChecked=310, Total=6480 [2022-03-03 17:24:35,547 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 1587 mSDsluCounter, 4592 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 4511 SdHoareTripleChecker+Invalid, 3070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:35,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1587 Valid, 4511 Invalid, 3070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1884 Invalid, 0 Unknown, 1116 Unchecked, 0.7s Time] [2022-03-03 17:24:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37603 states. [2022-03-03 17:24:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37603 to 12580. [2022-03-03 17:24:36,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12580 states, 12579 states have (on average 3.601955640352969) internal successors, (45309), 12579 states have internal predecessors, (45309), 0 states have call successors, (0), 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-03 17:24:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 45309 transitions. [2022-03-03 17:24:36,065 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 45309 transitions. Word has length 124 [2022-03-03 17:24:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:36,065 INFO L470 AbstractCegarLoop]: Abstraction has 12580 states and 45309 transitions. [2022-03-03 17:24:36,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.717391304347826) internal successors, (263), 46 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:24:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 45309 transitions. [2022-03-03 17:24:36,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:36,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:36,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:36,106 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-03 17:24:36,290 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,SelfDestructingSolverStorable15 [2022-03-03 17:24:36,291 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-03 17:24:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:36,292 INFO L85 PathProgramCache]: Analyzing trace with hash 2003048260, now seen corresponding path program 4 times [2022-03-03 17:24:36,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:36,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323303439] [2022-03-03 17:24:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:36,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:37,070 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-03 17:24:37,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:37,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323303439] [2022-03-03 17:24:37,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323303439] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:37,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891811599] [2022-03-03 17:24:37,071 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:24:37,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:37,072 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-03 17:24:37,073 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-03 17:24:37,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:24:37,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:37,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjunts are in the unsatisfiable core [2022-03-03 17:24:37,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:37,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:24:37,848 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-03 17:24:38,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:38,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:38,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:38,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:38,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 17:24:38,252 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-03 17:24:38,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:38,398 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-03-03 17:24:38,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ (* (- 1) |c_thread1Thread1of1ForFork0_~tmp~0#1|) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset)) 0)) is different from false [2022-03-03 17:24:38,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (+ c_~res2~0 (* (- 1) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)) 0)) is different from false [2022-03-03 17:24:38,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (+ (* (- 1) (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) c_~res1~0)))) is different from false [2022-03-03 17:24:38,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) c_~A~0.base) c_~A~0.offset) (* (- 1) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:38,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= 0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (* (- 1) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) c_~res2~0 (* (- 1) c_~res1~0) (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) is different from false [2022-03-03 17:24:38,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res2~0 (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:38,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_475))) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_476) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (* (- 1) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* (- 1) c_~res1~0))) 0)) is different from false [2022-03-03 17:24:38,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:38,549 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 55 treesize of output 44 [2022-03-03 17:24:38,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 790 treesize of output 726 [2022-03-03 17:24:38,554 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 726 treesize of output 694 [2022-03-03 17:24:38,558 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 694 treesize of output 662 [2022-03-03 17:24:38,564 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 662 treesize of output 646 [2022-03-03 17:24:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-03 17:24:38,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891811599] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:38,934 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:38,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 24, 22] total 63 [2022-03-03 17:24:38,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509984901] [2022-03-03 17:24:38,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:38,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-03 17:24:38,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-03 17:24:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2715, Unknown=8, NotChecked=904, Total=3906 [2022-03-03 17:24:38,936 INFO L87 Difference]: Start difference. First operand 12580 states and 45309 transitions. Second operand has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 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-03 17:24:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:24:42,009 INFO L93 Difference]: Finished difference Result 33688 states and 121423 transitions. [2022-03-03 17:24:42,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-03 17:24:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 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 124 [2022-03-03 17:24:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:24:42,109 INFO L225 Difference]: With dead ends: 33688 [2022-03-03 17:24:42,110 INFO L226 Difference]: Without dead ends: 33538 [2022-03-03 17:24:42,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 219 SyntacticMatches, 10 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=791, Invalid=7605, Unknown=8, NotChecked=1496, Total=9900 [2022-03-03 17:24:42,111 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 1331 mSDsluCounter, 6414 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 6367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3506 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-03 17:24:42,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1331 Valid, 6168 Invalid, 6367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2820 Invalid, 0 Unknown, 3506 Unchecked, 1.1s Time] [2022-03-03 17:24:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33538 states. [2022-03-03 17:24:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33538 to 12763. [2022-03-03 17:24:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12763 states, 12762 states have (on average 3.5981037454944365) internal successors, (45919), 12762 states have internal predecessors, (45919), 0 states have call successors, (0), 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-03 17:24:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12763 states to 12763 states and 45919 transitions. [2022-03-03 17:24:42,579 INFO L78 Accepts]: Start accepts. Automaton has 12763 states and 45919 transitions. Word has length 124 [2022-03-03 17:24:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:24:42,579 INFO L470 AbstractCegarLoop]: Abstraction has 12763 states and 45919 transitions. [2022-03-03 17:24:42,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.603174603174603) internal successors, (290), 63 states have internal predecessors, (290), 0 states have call successors, (0), 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-03 17:24:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 12763 states and 45919 transitions. [2022-03-03 17:24:42,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:24:42,602 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:24:42,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:24:42,620 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-03 17:24:42,811 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,SelfDestructingSolverStorable16 [2022-03-03 17:24:42,811 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-03 17:24:42,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:24:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -732266808, now seen corresponding path program 2 times [2022-03-03 17:24:42,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:24:42,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249143628] [2022-03-03 17:24:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:24:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:24:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:24:43,551 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-03 17:24:43,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:24:43,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249143628] [2022-03-03 17:24:43,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249143628] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:24:43,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965949011] [2022-03-03 17:24:43,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:24:43,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:24:43,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:24:43,552 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-03 17:24:43,553 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-03 17:24:43,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:24:43,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:24:43,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-03 17:24:43,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:24:44,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:44,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:44,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:24:44,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:24:44,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:44,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-03-03 17:24:45,015 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-03 17:24:45,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:24:45,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:24:45,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread3Thread1of1ForFork2_~i~2#1_41| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (or (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_41|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_511) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_41| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_41| 1) c_~N~0))) is different from false [2022-03-03 17:24:45,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:24:45,579 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 116 treesize of output 92 [2022-03-03 17:24:45,582 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 76 treesize of output 64 [2022-03-03 17:24:45,586 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 34 treesize of output 28 [2022-03-03 17:24:46,305 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-03 17:24:46,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965949011] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:24:46,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:24:46,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-03-03 17:24:46,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274159265] [2022-03-03 17:24:46,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:24:46,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-03 17:24:46,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:24:46,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-03 17:24:46,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=4049, Unknown=2, NotChecked=266, Total=4830 [2022-03-03 17:24:46,308 INFO L87 Difference]: Start difference. First operand 12763 states and 45919 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:25:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:25:22,273 INFO L93 Difference]: Finished difference Result 79616 states and 286747 transitions. [2022-03-03 17:25:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 449 states. [2022-03-03 17:25:22,274 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:25:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:25:22,542 INFO L225 Difference]: With dead ends: 79616 [2022-03-03 17:25:22,542 INFO L226 Difference]: Without dead ends: 79016 [2022-03-03 17:25:22,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 221 SyntacticMatches, 17 SemanticMatches, 498 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108475 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=19860, Invalid=227652, Unknown=2, NotChecked=1986, Total=249500 [2022-03-03 17:25:22,559 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 4336 mSDsluCounter, 19145 mSDsCounter, 0 mSdLazyCounter, 16335 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4336 SdHoareTripleChecker+Valid, 18196 SdHoareTripleChecker+Invalid, 20177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 16335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3463 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:25:22,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4336 Valid, 18196 Invalid, 20177 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [379 Valid, 16335 Invalid, 0 Unknown, 3463 Unchecked, 7.0s Time] [2022-03-03 17:25:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79016 states. [2022-03-03 17:25:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79016 to 13209. [2022-03-03 17:25:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13209 states, 13208 states have (on average 3.6281798909751664) internal successors, (47921), 13208 states have internal predecessors, (47921), 0 states have call successors, (0), 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-03 17:25:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13209 states to 13209 states and 47921 transitions. [2022-03-03 17:25:23,324 INFO L78 Accepts]: Start accepts. Automaton has 13209 states and 47921 transitions. Word has length 124 [2022-03-03 17:25:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:25:23,324 INFO L470 AbstractCegarLoop]: Abstraction has 13209 states and 47921 transitions. [2022-03-03 17:25:23,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:25:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13209 states and 47921 transitions. [2022-03-03 17:25:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:25:23,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:25:23,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:25:23,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-03 17:25:23,551 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,SelfDestructingSolverStorable17 [2022-03-03 17:25:23,551 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-03 17:25:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:25:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1913273718, now seen corresponding path program 3 times [2022-03-03 17:25:23,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:25:23,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707863152] [2022-03-03 17:25:23,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:25:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:25:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:25:24,238 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-03 17:25:24,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:25:24,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707863152] [2022-03-03 17:25:24,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707863152] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:25:24,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780252633] [2022-03-03 17:25:24,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:25:24,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:25:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:25:24,240 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-03 17:25:24,241 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-03 17:25:24,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:25:24,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:25:24,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 67 conjunts are in the unsatisfiable core [2022-03-03 17:25:24,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:25:25,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:25:25,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:25:25,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:25:25,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:25:25,324 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:25:25,324 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 21 treesize of output 21 [2022-03-03 17:25:25,962 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-03 17:25:25,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:25:26,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int)) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|))) is different from false [2022-03-03 17:25:26,573 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_44| Int) (v_ArrVal_544 (Array Int Int))) (or (< (+ |v_thread3Thread1of1ForFork2_~i~2#1_44| 1) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_44|) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_544) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_545) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_44| 4))))))) is different from false [2022-03-03 17:25:26,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:25:26,618 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 242 treesize of output 178 [2022-03-03 17:25:26,622 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 81 treesize of output 69 [2022-03-03 17:25:26,627 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 150 treesize of output 126 [2022-03-03 17:25:27,379 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-03 17:25:27,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780252633] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:25:27,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:25:27,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-03 17:25:27,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634463289] [2022-03-03 17:25:27,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:25:27,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-03 17:25:27,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:25:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-03 17:25:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=4170, Unknown=2, NotChecked=270, Total=4970 [2022-03-03 17:25:27,382 INFO L87 Difference]: Start difference. First operand 13209 states and 47921 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-03 17:25:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:25:58,510 INFO L93 Difference]: Finished difference Result 85389 states and 312374 transitions. [2022-03-03 17:25:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 465 states. [2022-03-03 17:25:58,511 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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 124 [2022-03-03 17:25:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:25:58,972 INFO L225 Difference]: With dead ends: 85389 [2022-03-03 17:25:58,972 INFO L226 Difference]: Without dead ends: 85089 [2022-03-03 17:25:58,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 208 SyntacticMatches, 8 SemanticMatches, 516 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 117629 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=22640, Invalid=243106, Unknown=2, NotChecked=2058, Total=267806 [2022-03-03 17:25:58,980 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 5255 mSDsluCounter, 14233 mSDsCounter, 0 mSdLazyCounter, 10722 mSolverCounterSat, 552 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5255 SdHoareTripleChecker+Valid, 13200 SdHoareTripleChecker+Invalid, 20805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 552 IncrementalHoareTripleChecker+Valid, 10722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9531 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:25:58,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5255 Valid, 13200 Invalid, 20805 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [552 Valid, 10722 Invalid, 0 Unknown, 9531 Unchecked, 4.9s Time] [2022-03-03 17:25:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85089 states. [2022-03-03 17:25:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85089 to 13314. [2022-03-03 17:25:59,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13314 states, 13313 states have (on average 3.6297603845864943) internal successors, (48323), 13313 states have internal predecessors, (48323), 0 states have call successors, (0), 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-03 17:25:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13314 states to 13314 states and 48323 transitions. [2022-03-03 17:25:59,920 INFO L78 Accepts]: Start accepts. Automaton has 13314 states and 48323 transitions. Word has length 124 [2022-03-03 17:25:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:25:59,921 INFO L470 AbstractCegarLoop]: Abstraction has 13314 states and 48323 transitions. [2022-03-03 17:25:59,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-03 17:25:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13314 states and 48323 transitions. [2022-03-03 17:25:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:25:59,946 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:25:59,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:25:59,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-03 17:26:00,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:00,147 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:26:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:26:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1254294472, now seen corresponding path program 4 times [2022-03-03 17:26:00,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:26:00,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596023629] [2022-03-03 17:26:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:26:00,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:26:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:26:00,840 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-03 17:26:00,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:26:00,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596023629] [2022-03-03 17:26:00,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596023629] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:26:00,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211063609] [2022-03-03 17:26:00,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:26:00,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:00,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:26:00,842 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-03 17:26:00,843 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-03 17:26:00,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:26:00,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:26:00,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:26:00,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:26:01,539 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-03 17:26:02,000 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-03 17:26:02,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:02,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:02,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:02,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:02,443 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:02,444 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 27 treesize of output 27 [2022-03-03 17:26:02,713 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-03 17:26:02,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:26:03,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,119 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,440 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_580))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_581) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:03,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:03,715 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 55 treesize of output 44 [2022-03-03 17:26:03,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:03,722 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 410 treesize of output 374 [2022-03-03 17:26:03,726 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 362 treesize of output 314 [2022-03-03 17:26:03,729 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 314 treesize of output 290 [2022-03-03 17:26:03,737 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:03,737 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 290 treesize of output 274 [2022-03-03 17:26:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:26:04,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211063609] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:26:04,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:26:04,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-03-03 17:26:04,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394115296] [2022-03-03 17:26:04,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:26:04,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-03 17:26:04,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:26:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-03 17:26:04,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=5417, Unknown=11, NotChecked=1256, Total=7140 [2022-03-03 17:26:04,801 INFO L87 Difference]: Start difference. First operand 13314 states and 48323 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:26:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:26:12,624 INFO L93 Difference]: Finished difference Result 34495 states and 124249 transitions. [2022-03-03 17:26:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-03 17:26:12,625 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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 124 [2022-03-03 17:26:12,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:26:12,724 INFO L225 Difference]: With dead ends: 34495 [2022-03-03 17:26:12,724 INFO L226 Difference]: Without dead ends: 34345 [2022-03-03 17:26:12,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 139 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5681 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1443, Invalid=16134, Unknown=11, NotChecked=2152, Total=19740 [2022-03-03 17:26:12,726 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 2109 mSDsluCounter, 10233 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 9882 SdHoareTripleChecker+Invalid, 10488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5987 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:26:12,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2109 Valid, 9882 Invalid, 10488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 4407 Invalid, 0 Unknown, 5987 Unchecked, 1.6s Time] [2022-03-03 17:26:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2022-03-03 17:26:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 13481. [2022-03-03 17:26:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13481 states, 13480 states have (on average 3.632492581602374) internal successors, (48966), 13480 states have internal predecessors, (48966), 0 states have call successors, (0), 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-03 17:26:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13481 states to 13481 states and 48966 transitions. [2022-03-03 17:26:13,172 INFO L78 Accepts]: Start accepts. Automaton has 13481 states and 48966 transitions. Word has length 124 [2022-03-03 17:26:13,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:26:13,172 INFO L470 AbstractCegarLoop]: Abstraction has 13481 states and 48966 transitions. [2022-03-03 17:26:13,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:26:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 13481 states and 48966 transitions. [2022-03-03 17:26:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:26:13,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:26:13,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:26:13,213 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-03 17:26:13,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:13,397 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:26:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:26:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2051171398, now seen corresponding path program 5 times [2022-03-03 17:26:13,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:26:13,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994989807] [2022-03-03 17:26:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:26:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:26:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:26:14,084 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-03 17:26:14,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:26:14,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994989807] [2022-03-03 17:26:14,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994989807] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:26:14,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869221767] [2022-03-03 17:26:14,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:26:14,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:14,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:26:14,086 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:26:14,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-03 17:26:14,172 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:26:14,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:26:14,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 83 conjunts are in the unsatisfiable core [2022-03-03 17:26:14,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:26:14,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:26:14,240 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:26:14,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:26:14,287 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-03-03 17:26:14,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-03-03 17:26:14,742 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-03-03 17:26:14,742 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 24 treesize of output 34 [2022-03-03 17:26:14,917 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:26:15,327 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:26:15,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:15,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:15,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:15,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:15,794 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 27 treesize of output 27 [2022-03-03 17:26:16,048 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-03 17:26:16,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:26:16,384 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int)) (or (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:16,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:16,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:16,507 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:26:16,522 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:26:16,548 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:26:16,748 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:26:16,778 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:26:16,822 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_622 (Array Int Int)) (~M~0 Int) (v_ArrVal_621 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_620))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:26:17,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:17,109 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 55 treesize of output 44 [2022-03-03 17:26:17,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:17,118 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 1670 treesize of output 1490 [2022-03-03 17:26:17,125 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 1478 treesize of output 1382 [2022-03-03 17:26:17,132 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 1382 treesize of output 1190 [2022-03-03 17:26:17,144 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:17,144 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 1190 treesize of output 1090 [2022-03-03 17:26:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:26:22,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869221767] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:26:22,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:26:22,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 34] total 85 [2022-03-03 17:26:22,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149630291] [2022-03-03 17:26:22,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:26:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-03 17:26:22,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:26:22,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-03 17:26:22,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=5300, Unknown=11, NotChecked=1404, Total=7140 [2022-03-03 17:26:22,026 INFO L87 Difference]: Start difference. First operand 13481 states and 48966 transitions. Second operand has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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-03 17:26:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:26:28,903 INFO L93 Difference]: Finished difference Result 32006 states and 115141 transitions. [2022-03-03 17:26:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-03 17:26:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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 124 [2022-03-03 17:26:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:26:29,003 INFO L225 Difference]: With dead ends: 32006 [2022-03-03 17:26:29,003 INFO L226 Difference]: Without dead ends: 31937 [2022-03-03 17:26:29,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 200 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 4108 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1133, Invalid=12002, Unknown=11, NotChecked=2106, Total=15252 [2022-03-03 17:26:29,005 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 1637 mSDsluCounter, 8667 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 8491 SdHoareTripleChecker+Invalid, 7791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5206 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:26:29,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1637 Valid, 8491 Invalid, 7791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2528 Invalid, 0 Unknown, 5206 Unchecked, 1.0s Time] [2022-03-03 17:26:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31937 states. [2022-03-03 17:26:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31937 to 13878. [2022-03-03 17:26:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13878 states, 13877 states have (on average 3.636737046912157) internal successors, (50467), 13877 states have internal predecessors, (50467), 0 states have call successors, (0), 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-03 17:26:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13878 states to 13878 states and 50467 transitions. [2022-03-03 17:26:29,453 INFO L78 Accepts]: Start accepts. Automaton has 13878 states and 50467 transitions. Word has length 124 [2022-03-03 17:26:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:26:29,453 INFO L470 AbstractCegarLoop]: Abstraction has 13878 states and 50467 transitions. [2022-03-03 17:26:29,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.447058823529412) internal successors, (293), 85 states have internal predecessors, (293), 0 states have call successors, (0), 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-03 17:26:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 13878 states and 50467 transitions. [2022-03-03 17:26:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:26:29,480 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:26:29,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:26:29,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-03 17:26:29,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:29,682 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:26:29,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:26:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1783840602, now seen corresponding path program 6 times [2022-03-03 17:26:29,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:26:29,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027606402] [2022-03-03 17:26:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:26:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:26:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:26:30,408 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-03 17:26:30,409 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:26:30,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027606402] [2022-03-03 17:26:30,409 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027606402] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:26:30,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60346059] [2022-03-03 17:26:30,409 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:26:30,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:30,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:26:30,410 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:26:30,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-03 17:26:30,504 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:26:30,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:26:30,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 17:26:30,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:26:30,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:26:30,787 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:26:30,787 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 11 treesize of output 11 [2022-03-03 17:26:31,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:31,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:31,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:31,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:31,458 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 27 treesize of output 27 [2022-03-03 17:26:31,805 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-03 17:26:31,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:26:32,222 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:32,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_657) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:26:32,325 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:32,325 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 116 treesize of output 92 [2022-03-03 17:26:32,328 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 76 treesize of output 64 [2022-03-03 17:26:32,332 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 34 treesize of output 28 [2022-03-03 17:26:33,399 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 10 treesize of output 8 [2022-03-03 17:26:33,462 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-03 17:26:33,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60346059] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:26:33,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:26:33,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-03 17:26:33,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160087863] [2022-03-03 17:26:33,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:26:33,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-03 17:26:33,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:26:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-03 17:26:33,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4287, Unknown=2, NotChecked=270, Total=4970 [2022-03-03 17:26:33,464 INFO L87 Difference]: Start difference. First operand 13878 states and 50467 transitions. Second operand has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-03 17:26:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:26:49,540 INFO L93 Difference]: Finished difference Result 43974 states and 160672 transitions. [2022-03-03 17:26:49,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-03 17:26:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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 124 [2022-03-03 17:26:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:26:49,683 INFO L225 Difference]: With dead ends: 43974 [2022-03-03 17:26:49,683 INFO L226 Difference]: Without dead ends: 43674 [2022-03-03 17:26:49,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 213 SyntacticMatches, 20 SemanticMatches, 232 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 19164 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=6994, Invalid=46604, Unknown=2, NotChecked=922, Total=54522 [2022-03-03 17:26:49,685 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 2977 mSDsluCounter, 13456 mSDsCounter, 0 mSdLazyCounter, 6174 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2977 SdHoareTripleChecker+Valid, 12937 SdHoareTripleChecker+Invalid, 14134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 6174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7829 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:26:49,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2977 Valid, 12937 Invalid, 14134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 6174 Invalid, 0 Unknown, 7829 Unchecked, 2.8s Time] [2022-03-03 17:26:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2022-03-03 17:26:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 14665. [2022-03-03 17:26:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14665 states, 14664 states have (on average 3.6644844517184945) internal successors, (53736), 14664 states have internal predecessors, (53736), 0 states have call successors, (0), 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-03 17:26:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14665 states to 14665 states and 53736 transitions. [2022-03-03 17:26:50,258 INFO L78 Accepts]: Start accepts. Automaton has 14665 states and 53736 transitions. Word has length 124 [2022-03-03 17:26:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:26:50,258 INFO L470 AbstractCegarLoop]: Abstraction has 14665 states and 53736 transitions. [2022-03-03 17:26:50,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.436619718309859) internal successors, (315), 71 states have internal predecessors, (315), 0 states have call successors, (0), 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-03 17:26:50,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14665 states and 53736 transitions. [2022-03-03 17:26:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:26:50,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:26:50,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:26:50,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-03 17:26:50,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:50,489 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:26:50,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:26:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash -369162054, now seen corresponding path program 7 times [2022-03-03 17:26:50,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:26:50,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237347627] [2022-03-03 17:26:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:26:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:26:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:26:51,219 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-03 17:26:51,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:26:51,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237347627] [2022-03-03 17:26:51,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237347627] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:26:51,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733494670] [2022-03-03 17:26:51,220 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:26:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:26:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:26:51,221 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:26:51,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-03 17:26:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:26:51,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:26:51,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:26:51,951 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-03 17:26:52,480 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-03 17:26:52,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:52,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:52,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:26:52,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:26:52,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:52,938 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 27 treesize of output 27 [2022-03-03 17:26:53,304 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-03 17:26:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:26:53,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-03 17:26:53,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-03 17:26:53,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-03 17:26:53,811 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-03 17:26:53,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:26:53,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:26:53,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))))) is different from false [2022-03-03 17:26:53,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_693 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_692))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_693) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-03 17:26:54,218 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:54,218 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 55 treesize of output 44 [2022-03-03 17:26:54,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:54,227 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 410 treesize of output 374 [2022-03-03 17:26:54,231 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 362 treesize of output 314 [2022-03-03 17:26:54,235 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 314 treesize of output 290 [2022-03-03 17:26:54,248 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:26:54,248 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 290 treesize of output 274 [2022-03-03 17:26:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:26:55,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733494670] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:26:55,742 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:26:55,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-03-03 17:26:55,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088741771] [2022-03-03 17:26:55,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:26:55,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-03 17:26:55,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:26:55,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-03 17:26:55,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=5244, Unknown=11, NotChecked=1240, Total=6972 [2022-03-03 17:26:55,744 INFO L87 Difference]: Start difference. First operand 14665 states and 53736 transitions. Second operand has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:27:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:27:00,677 INFO L93 Difference]: Finished difference Result 32412 states and 117800 transitions. [2022-03-03 17:27:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 17:27:00,677 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-03-03 17:27:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:27:00,774 INFO L225 Difference]: With dead ends: 32412 [2022-03-03 17:27:00,774 INFO L226 Difference]: Without dead ends: 32262 [2022-03-03 17:27:00,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5295 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1428, Invalid=14849, Unknown=11, NotChecked=2072, Total=18360 [2022-03-03 17:27:00,776 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 1734 mSDsluCounter, 9318 mSDsCounter, 0 mSdLazyCounter, 3720 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 9080 SdHoareTripleChecker+Invalid, 8309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4526 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:27:00,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1734 Valid, 9080 Invalid, 8309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3720 Invalid, 0 Unknown, 4526 Unchecked, 1.4s Time] [2022-03-03 17:27:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32262 states. [2022-03-03 17:27:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32262 to 14531. [2022-03-03 17:27:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14531 states, 14530 states have (on average 3.658981417756366) internal successors, (53165), 14530 states have internal predecessors, (53165), 0 states have call successors, (0), 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-03 17:27:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14531 states to 14531 states and 53165 transitions. [2022-03-03 17:27:01,309 INFO L78 Accepts]: Start accepts. Automaton has 14531 states and 53165 transitions. Word has length 124 [2022-03-03 17:27:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:27:01,309 INFO L470 AbstractCegarLoop]: Abstraction has 14531 states and 53165 transitions. [2022-03-03 17:27:01,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.630952380952381) internal successors, (305), 84 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:27:01,310 INFO L276 IsEmpty]: Start isEmpty. Operand 14531 states and 53165 transitions. [2022-03-03 17:27:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:27:01,339 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:27:01,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:27:01,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-03 17:27:01,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:27:01,539 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:27:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:27:01,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1457504890, now seen corresponding path program 8 times [2022-03-03 17:27:01,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:27:01,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41871806] [2022-03-03 17:27:01,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:27:01,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:27:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:27:02,428 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-03 17:27:02,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:27:02,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41871806] [2022-03-03 17:27:02,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41871806] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:27:02,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330628703] [2022-03-03 17:27:02,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:27:02,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:27:02,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:27:02,430 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:27:02,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-03 17:27:02,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:27:02,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:27:02,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-03 17:27:02,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:27:02,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:27:02,604 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:27:02,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:27:02,807 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:27:02,807 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 16 treesize of output 18 [2022-03-03 17:27:03,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:03,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:03,443 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:03,444 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 27 treesize of output 27 [2022-03-03 17:27:03,783 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-03 17:27:03,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:27:04,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-03 17:27:04,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_729 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_730) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)))) is different from false [2022-03-03 17:27:04,284 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:04,285 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 116 treesize of output 92 [2022-03-03 17:27:04,294 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 76 treesize of output 64 [2022-03-03 17:27:04,298 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 34 treesize of output 28 [2022-03-03 17:27:05,206 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 13 treesize of output 11 [2022-03-03 17:27:05,226 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-03 17:27:05,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330628703] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:27:05,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:27:05,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 71 [2022-03-03 17:27:05,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365423063] [2022-03-03 17:27:05,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:27:05,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-03-03 17:27:05,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:27:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-03-03 17:27:05,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4258, Unknown=2, NotChecked=270, Total=4970 [2022-03-03 17:27:05,228 INFO L87 Difference]: Start difference. First operand 14531 states and 53165 transitions. Second operand has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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-03 17:27:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:27:23,301 INFO L93 Difference]: Finished difference Result 54394 states and 196928 transitions. [2022-03-03 17:27:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-03-03 17:27:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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 124 [2022-03-03 17:27:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:27:23,489 INFO L225 Difference]: With dead ends: 54394 [2022-03-03 17:27:23,490 INFO L226 Difference]: Without dead ends: 53839 [2022-03-03 17:27:23,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 219 SyntacticMatches, 13 SemanticMatches, 303 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 36334 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=10834, Invalid=80678, Unknown=2, NotChecked=1206, Total=92720 [2022-03-03 17:27:23,494 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 3917 mSDsluCounter, 13641 mSDsCounter, 0 mSdLazyCounter, 5294 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3917 SdHoareTripleChecker+Valid, 12853 SdHoareTripleChecker+Invalid, 19791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 5294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14319 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:27:23,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3917 Valid, 12853 Invalid, 19791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 5294 Invalid, 0 Unknown, 14319 Unchecked, 2.5s Time] [2022-03-03 17:27:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53839 states. [2022-03-03 17:27:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53839 to 15140. [2022-03-03 17:27:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15140 states, 15139 states have (on average 3.6635841204835193) internal successors, (55463), 15139 states have internal predecessors, (55463), 0 states have call successors, (0), 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-03 17:27:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15140 states to 15140 states and 55463 transitions. [2022-03-03 17:27:24,189 INFO L78 Accepts]: Start accepts. Automaton has 15140 states and 55463 transitions. Word has length 124 [2022-03-03 17:27:24,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:27:24,189 INFO L470 AbstractCegarLoop]: Abstraction has 15140 states and 55463 transitions. [2022-03-03 17:27:24,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 4.408450704225352) internal successors, (313), 71 states have internal predecessors, (313), 0 states have call successors, (0), 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-03 17:27:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15140 states and 55463 transitions. [2022-03-03 17:27:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:27:24,218 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:27:24,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:27:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-03 17:27:24,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:27:24,418 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:27:24,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:27:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -89866212, now seen corresponding path program 9 times [2022-03-03 17:27:24,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:27:24,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76165558] [2022-03-03 17:27:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:27:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:27:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:27:25,123 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-03 17:27:25,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:27:25,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76165558] [2022-03-03 17:27:25,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76165558] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:27:25,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231852394] [2022-03-03 17:27:25,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:27:25,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:27:25,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:27:25,125 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:27:25,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-03 17:27:25,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:27:25,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:27:25,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:27:25,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:27:25,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:27:25,356 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:27:25,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:27:25,595 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:27:25,596 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 16 treesize of output 18 [2022-03-03 17:27:25,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:27:25,992 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-03 17:27:26,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:26,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:26,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:26,397 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 27 treesize of output 27 [2022-03-03 17:27:26,758 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-03 17:27:26,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:27:27,143 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:27:27,197 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:27:27,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-03 17:27:27,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-03 17:27:27,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (< 0 ~M~0))) is different from false [2022-03-03 17:27:27,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-03 17:27:27,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) is different from false [2022-03-03 17:27:27,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) is different from false [2022-03-03 17:27:27,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_769 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) 0) (< 0 ~M~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_767))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_768) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_769) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-03 17:27:27,530 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:27,530 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 55 treesize of output 44 [2022-03-03 17:27:27,539 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 17:27:27,539 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 1670 treesize of output 1482 [2022-03-03 17:27:27,551 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 1478 treesize of output 1382 [2022-03-03 17:27:27,557 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 1382 treesize of output 1190 [2022-03-03 17:27:27,570 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 17:27:27,570 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 1190 treesize of output 1082 [2022-03-03 17:27:31,253 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 13 treesize of output 11 [2022-03-03 17:27:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-03 17:27:31,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231852394] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:27:31,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:27:31,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 75 [2022-03-03 17:27:31,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044480509] [2022-03-03 17:27:31,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:27:31,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-03-03 17:27:31,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:27:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-03-03 17:27:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3909, Unknown=9, NotChecked=1224, Total=5550 [2022-03-03 17:27:31,275 INFO L87 Difference]: Start difference. First operand 15140 states and 55463 transitions. Second operand has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 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-03 17:27:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:27:48,515 INFO L93 Difference]: Finished difference Result 43208 states and 157975 transitions. [2022-03-03 17:27:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2022-03-03 17:27:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 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) Word has length 124 [2022-03-03 17:27:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:27:48,721 INFO L225 Difference]: With dead ends: 43208 [2022-03-03 17:27:48,721 INFO L226 Difference]: Without dead ends: 42908 [2022-03-03 17:27:48,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 215 SyntacticMatches, 12 SemanticMatches, 254 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 22032 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=7776, Invalid=53013, Unknown=9, NotChecked=4482, Total=65280 [2022-03-03 17:27:48,724 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 2963 mSDsluCounter, 12739 mSDsCounter, 0 mSdLazyCounter, 5986 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 12056 SdHoareTripleChecker+Invalid, 21478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15357 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:27:48,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2963 Valid, 12056 Invalid, 21478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5986 Invalid, 0 Unknown, 15357 Unchecked, 2.6s Time] [2022-03-03 17:27:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42908 states. [2022-03-03 17:27:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42908 to 14977. [2022-03-03 17:27:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14977 states, 14976 states have (on average 3.655582264957265) internal successors, (54746), 14976 states have internal predecessors, (54746), 0 states have call successors, (0), 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-03 17:27:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14977 states to 14977 states and 54746 transitions. [2022-03-03 17:27:49,175 INFO L78 Accepts]: Start accepts. Automaton has 14977 states and 54746 transitions. Word has length 124 [2022-03-03 17:27:49,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:27:49,176 INFO L470 AbstractCegarLoop]: Abstraction has 14977 states and 54746 transitions. [2022-03-03 17:27:49,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.16) internal successors, (312), 75 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-03 17:27:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 14977 states and 54746 transitions. [2022-03-03 17:27:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:27:49,203 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:27:49,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:27:49,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-03 17:27:49,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-03 17:27:49,404 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:27:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:27:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1002033640, now seen corresponding path program 10 times [2022-03-03 17:27:49,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:27:49,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624177026] [2022-03-03 17:27:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:27:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:27:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:27:50,078 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-03 17:27:50,078 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:27:50,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624177026] [2022-03-03 17:27:50,078 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624177026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:27:50,078 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738837428] [2022-03-03 17:27:50,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:27:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:27:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:27:50,080 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:27:50,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-03 17:27:50,173 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:27:50,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:27:50,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:27:50,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:27:50,797 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-03 17:27:51,260 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-03 17:27:51,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:27:51,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:51,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:27:51,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:27:51,709 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:51,709 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 27 treesize of output 27 [2022-03-03 17:27:51,984 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-03 17:27:51,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:27:52,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,417 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (= (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,462 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-03 17:27:52,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_805 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_806 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_804))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_805) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_806) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:27:52,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:52,871 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 55 treesize of output 44 [2022-03-03 17:27:52,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:52,882 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 830 treesize of output 746 [2022-03-03 17:27:52,887 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 734 treesize of output 686 [2022-03-03 17:27:52,892 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 686 treesize of output 590 [2022-03-03 17:27:52,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:27:52,902 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 590 treesize of output 546 [2022-03-03 17:27:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:27:59,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738837428] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:27:59,245 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:27:59,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 85 [2022-03-03 17:27:59,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500647989] [2022-03-03 17:27:59,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:27:59,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-03-03 17:27:59,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:27:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-03-03 17:27:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=5341, Unknown=11, NotChecked=1256, Total=7140 [2022-03-03 17:27:59,246 INFO L87 Difference]: Start difference. First operand 14977 states and 54746 transitions. Second operand has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:28:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:12,927 INFO L93 Difference]: Finished difference Result 35017 states and 126569 transitions. [2022-03-03 17:28:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-03 17:28:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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 124 [2022-03-03 17:28:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:13,028 INFO L225 Difference]: With dead ends: 35017 [2022-03-03 17:28:13,029 INFO L226 Difference]: Without dead ends: 34723 [2022-03-03 17:28:13,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 200 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 5375 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1577, Invalid=14956, Unknown=11, NotChecked=2088, Total=18632 [2022-03-03 17:28:13,031 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1955 mSDsluCounter, 9525 mSDsCounter, 0 mSdLazyCounter, 3988 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 9193 SdHoareTripleChecker+Invalid, 9801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5756 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:13,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1955 Valid, 9193 Invalid, 9801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3988 Invalid, 0 Unknown, 5756 Unchecked, 1.6s Time] [2022-03-03 17:28:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34723 states. [2022-03-03 17:28:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34723 to 15137. [2022-03-03 17:28:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 3.658958773784355) internal successors, (55382), 15136 states have internal predecessors, (55382), 0 states have call successors, (0), 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-03 17:28:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 55382 transitions. [2022-03-03 17:28:13,537 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 55382 transitions. Word has length 124 [2022-03-03 17:28:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:13,537 INFO L470 AbstractCegarLoop]: Abstraction has 15137 states and 55382 transitions. [2022-03-03 17:28:13,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 3.458823529411765) internal successors, (294), 85 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:28:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 55382 transitions. [2022-03-03 17:28:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:28:13,568 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:13,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:28:13,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-03 17:28:13,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-03 17:28:13,768 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:28:13,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1740562566, now seen corresponding path program 11 times [2022-03-03 17:28:13,770 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:13,770 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391416004] [2022-03-03 17:28:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:14,501 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-03 17:28:14,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:14,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391416004] [2022-03-03 17:28:14,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391416004] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:14,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408000606] [2022-03-03 17:28:14,502 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:28:14,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:14,503 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:14,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-03 17:28:14,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:28:14,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:28:14,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 84 conjunts are in the unsatisfiable core [2022-03-03 17:28:14,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:15,242 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-03 17:28:15,742 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-03 17:28:16,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:16,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:16,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:16,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:16,301 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:16,301 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 21 treesize of output 21 [2022-03-03 17:28:16,646 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-03 17:28:16,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:16,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:28:17,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-03 17:28:17,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-03 17:28:17,098 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-03 17:28:17,114 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:28:17,144 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-03-03 17:28:17,278 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))))) is different from false [2022-03-03 17:28:17,307 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0)))))) is different from false [2022-03-03 17:28:17,324 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (~M~0 Int) (v_ArrVal_841 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_841))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (< ~M~0 c_~N~0)))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:28:17,585 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:17,585 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 55 treesize of output 44 [2022-03-03 17:28:17,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:17,594 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 1670 treesize of output 1490 [2022-03-03 17:28:17,601 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 1478 treesize of output 1382 [2022-03-03 17:28:17,607 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 1382 treesize of output 1190 [2022-03-03 17:28:17,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:17,620 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 1190 treesize of output 1090 [2022-03-03 17:28:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:28:18,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408000606] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:28:18,957 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:28:18,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 83 [2022-03-03 17:28:18,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356175322] [2022-03-03 17:28:18,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:28:18,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-03-03 17:28:18,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:18,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-03-03 17:28:18,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=504, Invalid=4923, Unknown=11, NotChecked=1368, Total=6806 [2022-03-03 17:28:18,959 INFO L87 Difference]: Start difference. First operand 15137 states and 55382 transitions. Second operand has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 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-03 17:28:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:26,038 INFO L93 Difference]: Finished difference Result 35225 states and 128124 transitions. [2022-03-03 17:28:26,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-03 17:28:26,039 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 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 124 [2022-03-03 17:28:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:26,143 INFO L225 Difference]: With dead ends: 35225 [2022-03-03 17:28:26,144 INFO L226 Difference]: Without dead ends: 35075 [2022-03-03 17:28:26,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 197 SyntacticMatches, 9 SemanticMatches, 132 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 5053 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1506, Invalid=14019, Unknown=11, NotChecked=2286, Total=17822 [2022-03-03 17:28:26,146 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1868 mSDsluCounter, 7743 mSDsCounter, 0 mSdLazyCounter, 3831 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 7461 SdHoareTripleChecker+Invalid, 8211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4261 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:26,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1868 Valid, 7461 Invalid, 8211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3831 Invalid, 0 Unknown, 4261 Unchecked, 1.5s Time] [2022-03-03 17:28:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35075 states. [2022-03-03 17:28:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35075 to 15204. [2022-03-03 17:28:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15204 states, 15203 states have (on average 3.658817338683155) internal successors, (55625), 15203 states have internal predecessors, (55625), 0 states have call successors, (0), 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-03 17:28:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15204 states to 15204 states and 55625 transitions. [2022-03-03 17:28:26,679 INFO L78 Accepts]: Start accepts. Automaton has 15204 states and 55625 transitions. Word has length 124 [2022-03-03 17:28:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:26,680 INFO L470 AbstractCegarLoop]: Abstraction has 15204 states and 55625 transitions. [2022-03-03 17:28:26,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 3.6144578313253013) internal successors, (300), 83 states have internal predecessors, (300), 0 states have call successors, (0), 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-03 17:28:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15204 states and 55625 transitions. [2022-03-03 17:28:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:28:26,708 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:26,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:28:26,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-03 17:28:26,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-03 17:28:26,909 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:28:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash -640143214, now seen corresponding path program 12 times [2022-03-03 17:28:26,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:26,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385184697] [2022-03-03 17:28:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:27,609 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-03 17:28:27,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:27,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385184697] [2022-03-03 17:28:27,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385184697] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:27,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713659524] [2022-03-03 17:28:27,609 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:28:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:27,610 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:27,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-03 17:28:27,709 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:28:27,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:28:27,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-03 17:28:27,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:28,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:28,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:28,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:28,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:28,617 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:28,618 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 27 treesize of output 27 [2022-03-03 17:28:28,970 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-03 17:28:28,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:29,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:28:29,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_876 (Array Int Int)) (v_ArrVal_877 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_876) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_877) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:28:29,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:29,509 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 116 treesize of output 92 [2022-03-03 17:28:29,511 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 76 treesize of output 64 [2022-03-03 17:28:29,515 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 34 treesize of output 28 [2022-03-03 17:28:30,257 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-03 17:28:30,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713659524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:28:30,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:28:30,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 26] total 70 [2022-03-03 17:28:30,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994089180] [2022-03-03 17:28:30,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:28:30,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-03-03 17:28:30,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:28:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-03-03 17:28:30,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=4227, Unknown=2, NotChecked=266, Total=4830 [2022-03-03 17:28:30,259 INFO L87 Difference]: Start difference. First operand 15204 states and 55625 transitions. Second operand has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:28:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:28:55,142 INFO L93 Difference]: Finished difference Result 81532 states and 295501 transitions. [2022-03-03 17:28:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 342 states. [2022-03-03 17:28:55,142 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:28:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:28:55,402 INFO L225 Difference]: With dead ends: 81532 [2022-03-03 17:28:55,402 INFO L226 Difference]: Without dead ends: 80932 [2022-03-03 17:28:55,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 251 SyntacticMatches, 17 SemanticMatches, 387 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63082 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=12290, Invalid=137098, Unknown=2, NotChecked=1542, Total=150932 [2022-03-03 17:28:55,411 INFO L933 BasicCegarLoop]: 505 mSDtfsCounter, 3949 mSDsluCounter, 15551 mSDsCounter, 0 mSdLazyCounter, 8742 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 14875 SdHoareTripleChecker+Invalid, 16617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 8742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7638 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:28:55,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3949 Valid, 14875 Invalid, 16617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 8742 Invalid, 0 Unknown, 7638 Unchecked, 4.0s Time] [2022-03-03 17:28:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80932 states. [2022-03-03 17:28:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80932 to 15290. [2022-03-03 17:28:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15290 states, 15289 states have (on average 3.668258224867552) internal successors, (56084), 15289 states have internal predecessors, (56084), 0 states have call successors, (0), 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-03 17:28:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15290 states to 15290 states and 56084 transitions. [2022-03-03 17:28:56,507 INFO L78 Accepts]: Start accepts. Automaton has 15290 states and 56084 transitions. Word has length 124 [2022-03-03 17:28:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:28:56,507 INFO L470 AbstractCegarLoop]: Abstraction has 15290 states and 56084 transitions. [2022-03-03 17:28:56,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 4.385714285714286) internal successors, (307), 70 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:28:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 15290 states and 56084 transitions. [2022-03-03 17:28:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:28:56,534 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:28:56,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:28:56,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-03 17:28:56,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:56,735 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:28:56,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:28:56,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1636201500, now seen corresponding path program 13 times [2022-03-03 17:28:56,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:28:56,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219274924] [2022-03-03 17:28:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:28:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:28:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:57,610 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-03 17:28:57,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:28:57,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219274924] [2022-03-03 17:28:57,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219274924] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:28:57,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654906262] [2022-03-03 17:28:57,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:28:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:28:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:28:57,612 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:28:57,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-03 17:28:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:28:57,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:28:57,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:28:58,341 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-03 17:28:58,815 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-03 17:28:59,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:59,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:59,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:28:59,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:28:59,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:28:59,270 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 27 treesize of output 27 [2022-03-03 17:28:59,546 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-03 17:28:59,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:28:59,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-03 17:28:59,942 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:28:59,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:00,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-03 17:29:00,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:00,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:00,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:00,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (~M~0 Int) (v_ArrVal_914 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_912))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_913) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_914) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:29:00,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:00,414 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 55 treesize of output 44 [2022-03-03 17:29:00,421 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:00,421 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 1670 treesize of output 1490 [2022-03-03 17:29:00,428 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 1478 treesize of output 1382 [2022-03-03 17:29:00,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:00,440 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 1382 treesize of output 1282 [2022-03-03 17:29:00,448 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 1270 treesize of output 1078 [2022-03-03 17:29:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:29:07,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654906262] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:07,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:07,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 84 [2022-03-03 17:29:07,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493220731] [2022-03-03 17:29:07,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:07,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-03 17:29:07,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-03 17:29:07,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=5306, Unknown=11, NotChecked=1240, Total=6972 [2022-03-03 17:29:07,279 INFO L87 Difference]: Start difference. First operand 15290 states and 56084 transitions. Second operand has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 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-03 17:29:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:13,768 INFO L93 Difference]: Finished difference Result 38478 states and 140589 transitions. [2022-03-03 17:29:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-03 17:29:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 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 124 [2022-03-03 17:29:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:13,873 INFO L225 Difference]: With dead ends: 38478 [2022-03-03 17:29:13,874 INFO L226 Difference]: Without dead ends: 38328 [2022-03-03 17:29:13,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 200 SyntacticMatches, 10 SemanticMatches, 156 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7206 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2095, Invalid=20276, Unknown=11, NotChecked=2424, Total=24806 [2022-03-03 17:29:13,876 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 3412 mSDsluCounter, 10343 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3412 SdHoareTripleChecker+Valid, 9915 SdHoareTripleChecker+Invalid, 11100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 4148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6854 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:13,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3412 Valid, 9915 Invalid, 11100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 4148 Invalid, 0 Unknown, 6854 Unchecked, 1.7s Time] [2022-03-03 17:29:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38328 states. [2022-03-03 17:29:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38328 to 14559. [2022-03-03 17:29:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14559 states, 14558 states have (on average 3.6517378760818793) internal successors, (53162), 14558 states have internal predecessors, (53162), 0 states have call successors, (0), 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-03 17:29:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 53162 transitions. [2022-03-03 17:29:14,324 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 53162 transitions. Word has length 124 [2022-03-03 17:29:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:14,324 INFO L470 AbstractCegarLoop]: Abstraction has 14559 states and 53162 transitions. [2022-03-03 17:29:14,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 3.5357142857142856) internal successors, (297), 84 states have internal predecessors, (297), 0 states have call successors, (0), 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-03 17:29:14,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 53162 transitions. [2022-03-03 17:29:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:29:14,350 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:14,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:29:14,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:14,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-03 17:29:14,551 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:29:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2068566152, now seen corresponding path program 14 times [2022-03-03 17:29:14,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:14,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912254683] [2022-03-03 17:29:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:15,173 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-03 17:29:15,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:15,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912254683] [2022-03-03 17:29:15,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912254683] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:15,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875189700] [2022-03-03 17:29:15,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:29:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:15,174 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:29:15,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-03 17:29:15,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:29:15,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:15,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 77 conjunts are in the unsatisfiable core [2022-03-03 17:29:15,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:15,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:29:15,356 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-03-03 17:29:15,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-03-03 17:29:15,583 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:15,583 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 15 treesize of output 15 [2022-03-03 17:29:16,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:29:16,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:16,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:29:16,571 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:16,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-03-03 17:29:16,740 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-03 17:29:16,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:17,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_950 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_950) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 ~M~0))) is different from false [2022-03-03 17:29:17,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_949 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_949) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_950) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|) (< 0 ~M~0))) is different from false [2022-03-03 17:29:17,182 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:17,183 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 242 treesize of output 178 [2022-03-03 17:29:17,186 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 81 treesize of output 69 [2022-03-03 17:29:17,189 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 150 treesize of output 126 [2022-03-03 17:29:18,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-03 17:29:18,254 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 10 treesize of output 8 [2022-03-03 17:29:18,274 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-03 17:29:18,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875189700] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:18,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:18,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 63 [2022-03-03 17:29:18,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046644108] [2022-03-03 17:29:18,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:18,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-03 17:29:18,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-03 17:29:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=3321, Unknown=2, NotChecked=238, Total=3906 [2022-03-03 17:29:18,276 INFO L87 Difference]: Start difference. First operand 14559 states and 53162 transitions. Second operand has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:29:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:25,575 INFO L93 Difference]: Finished difference Result 38539 states and 141440 transitions. [2022-03-03 17:29:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-03 17:29:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 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 124 [2022-03-03 17:29:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:25,684 INFO L225 Difference]: With dead ends: 38539 [2022-03-03 17:29:25,684 INFO L226 Difference]: Without dead ends: 38470 [2022-03-03 17:29:25,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 212 SyntacticMatches, 4 SemanticMatches, 142 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6610 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2433, Invalid=17595, Unknown=2, NotChecked=562, Total=20592 [2022-03-03 17:29:25,686 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 1978 mSDsluCounter, 9344 mSDsCounter, 0 mSdLazyCounter, 6105 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1978 SdHoareTripleChecker+Valid, 8817 SdHoareTripleChecker+Invalid, 9130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 6105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2922 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:25,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1978 Valid, 8817 Invalid, 9130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 6105 Invalid, 0 Unknown, 2922 Unchecked, 2.6s Time] [2022-03-03 17:29:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38470 states. [2022-03-03 17:29:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38470 to 14572. [2022-03-03 17:29:26,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14572 states, 14571 states have (on average 3.6532152906458033) internal successors, (53231), 14571 states have internal predecessors, (53231), 0 states have call successors, (0), 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-03 17:29:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 53231 transitions. [2022-03-03 17:29:26,208 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 53231 transitions. Word has length 124 [2022-03-03 17:29:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:26,209 INFO L470 AbstractCegarLoop]: Abstraction has 14572 states and 53231 transitions. [2022-03-03 17:29:26,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 5.031746031746032) internal successors, (317), 63 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:29:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 53231 transitions. [2022-03-03 17:29:26,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:29:26,234 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:26,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:29:26,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:26,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:26,435 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:29:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -466546552, now seen corresponding path program 15 times [2022-03-03 17:29:26,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:26,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041108107] [2022-03-03 17:29:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:27,122 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-03 17:29:27,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:27,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041108107] [2022-03-03 17:29:27,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041108107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:27,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618269809] [2022-03-03 17:29:27,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:29:27,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:27,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:27,124 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:29:27,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-03 17:29:27,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:29:27,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:27,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 79 conjunts are in the unsatisfiable core [2022-03-03 17:29:27,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:27,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:29:27,579 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:29:27,579 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 11 treesize of output 11 [2022-03-03 17:29:27,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:29:28,039 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-03 17:29:28,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:29:28,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:29:28,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:29:28,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:28,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-03-03 17:29:28,912 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-03 17:29:28,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:29:29,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4))) c_~res2~0)) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-03 17:29:29,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:29:29,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (<= (+ 2 |v_thread3Thread1of1ForFork2_~i~2#1_80|) c_~N~0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-03 17:29:29,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)) (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|))) is different from false [2022-03-03 17:29:29,418 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-03 17:29:29,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-03 17:29:29,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0) (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4)))))))) is different from false [2022-03-03 17:29:29,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-03 17:29:29,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_986 (Array Int Int)) (v_ArrVal_988 (Array Int Int)) (v_ArrVal_987 (Array Int Int)) (|v_thread3Thread1of1ForFork2_~i~2#1_80| Int)) (or (<= (+ |v_thread3Thread1of1ForFork2_~i~2#1_80| 1) 0) (< 0 |v_thread3Thread1of1ForFork2_~i~2#1_80|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_986))) (= (+ c_~res2~0 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_987) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_80| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:29:29,698 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:29:29,698 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 55 treesize of output 44 [2022-03-03 17:29:29,708 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 17:29:29,709 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 3350 treesize of output 2970 [2022-03-03 17:29:29,730 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 2966 treesize of output 2582 [2022-03-03 17:29:29,739 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 2582 treesize of output 2390 [2022-03-03 17:29:29,753 INFO L353 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-03-03 17:29:29,753 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 2390 treesize of output 2170 [2022-03-03 17:29:48,469 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 10 treesize of output 8 [2022-03-03 17:29:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-03 17:29:48,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618269809] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:29:48,525 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:29:48,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 28] total 72 [2022-03-03 17:29:48,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011938620] [2022-03-03 17:29:48,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:29:48,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-03 17:29:48,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:29:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-03 17:29:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=3532, Unknown=9, NotChecked=1170, Total=5112 [2022-03-03 17:29:48,526 INFO L87 Difference]: Start difference. First operand 14572 states and 53231 transitions. Second operand has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 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-03 17:29:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:29:57,106 INFO L93 Difference]: Finished difference Result 45167 states and 164008 transitions. [2022-03-03 17:29:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-03 17:29:57,106 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 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 124 [2022-03-03 17:29:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:29:57,229 INFO L225 Difference]: With dead ends: 45167 [2022-03-03 17:29:57,230 INFO L226 Difference]: Without dead ends: 45029 [2022-03-03 17:29:57,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 209 SyntacticMatches, 8 SemanticMatches, 180 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 11505 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2884, Invalid=26899, Unknown=9, NotChecked=3150, Total=32942 [2022-03-03 17:29:57,233 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 1944 mSDsluCounter, 11315 mSDsCounter, 0 mSdLazyCounter, 8385 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 10490 SdHoareTripleChecker+Invalid, 15320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 8385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6845 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:29:57,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1944 Valid, 10490 Invalid, 15320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 8385 Invalid, 0 Unknown, 6845 Unchecked, 3.4s Time] [2022-03-03 17:29:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45029 states. [2022-03-03 17:29:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45029 to 14617. [2022-03-03 17:29:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14617 states, 14616 states have (on average 3.652504105090312) internal successors, (53385), 14616 states have internal predecessors, (53385), 0 states have call successors, (0), 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-03 17:29:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14617 states to 14617 states and 53385 transitions. [2022-03-03 17:29:57,864 INFO L78 Accepts]: Start accepts. Automaton has 14617 states and 53385 transitions. Word has length 124 [2022-03-03 17:29:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:29:57,864 INFO L470 AbstractCegarLoop]: Abstraction has 14617 states and 53385 transitions. [2022-03-03 17:29:57,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.416666666666667) internal successors, (318), 72 states have internal predecessors, (318), 0 states have call successors, (0), 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-03 17:29:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14617 states and 53385 transitions. [2022-03-03 17:29:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:29:57,891 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:29:57,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:29:57,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-03 17:29:58,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-03-03 17:29:58,099 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:29:58,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:29:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2055882024, now seen corresponding path program 16 times [2022-03-03 17:29:58,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:29:58,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127293250] [2022-03-03 17:29:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:29:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:29:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:29:58,833 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-03 17:29:58,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:29:58,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127293250] [2022-03-03 17:29:58,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127293250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:29:58,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58798508] [2022-03-03 17:29:58,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:29:58,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:29:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:29:58,835 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:29:58,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-03 17:29:58,937 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:29:58,937 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:29:58,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:29:58,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:29:59,567 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-03 17:30:00,040 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-03 17:30:00,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:30:00,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:30:00,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-03 17:30:00,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-03 17:30:00,615 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:00,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:30:00,843 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-03 17:30:00,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:01,132 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= |c_thread1Thread1of1ForFork0_~tmp~0#1| (+ c_~res2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) is different from false [2022-03-03 17:30:01,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2022-03-03 17:30:01,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0)))) is different from false [2022-03-03 17:30:01,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= (+ c_~res2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~res1~0)))) is different from false [2022-03-03 17:30:01,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-03 17:30:01,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-03 17:30:01,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ c_~res1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0))) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-03 17:30:01,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1024 (Array Int Int)) (v_ArrVal_1023 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1023))) (= (+ (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1024) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1025) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:30:01,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:01,670 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 55 treesize of output 44 [2022-03-03 17:30:01,680 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:01,680 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 830 treesize of output 746 [2022-03-03 17:30:01,685 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 734 treesize of output 638 [2022-03-03 17:30:01,691 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 638 treesize of output 590 [2022-03-03 17:30:01,704 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:01,704 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 590 treesize of output 546 [2022-03-03 17:30:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:30:03,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58798508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:03,748 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:03,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 81 [2022-03-03 17:30:03,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95707891] [2022-03-03 17:30:03,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:03,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-03 17:30:03,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:03,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-03 17:30:03,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=4772, Unknown=11, NotChecked=1192, Total=6480 [2022-03-03 17:30:03,750 INFO L87 Difference]: Start difference. First operand 14617 states and 53385 transitions. Second operand has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:30:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:08,931 INFO L93 Difference]: Finished difference Result 33108 states and 120095 transitions. [2022-03-03 17:30:08,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-03 17:30:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-03-03 17:30:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:09,023 INFO L225 Difference]: With dead ends: 33108 [2022-03-03 17:30:09,023 INFO L226 Difference]: Without dead ends: 32958 [2022-03-03 17:30:09,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 203 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 4215 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1271, Invalid=11182, Unknown=11, NotChecked=1816, Total=14280 [2022-03-03 17:30:09,024 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 1394 mSDsluCounter, 9172 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 8762 SdHoareTripleChecker+Invalid, 8598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5202 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:09,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1394 Valid, 8762 Invalid, 8598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3345 Invalid, 0 Unknown, 5202 Unchecked, 1.3s Time] [2022-03-03 17:30:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32958 states. [2022-03-03 17:30:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32958 to 14528. [2022-03-03 17:30:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14528 states, 14527 states have (on average 3.6524402836098298) internal successors, (53059), 14527 states have internal predecessors, (53059), 0 states have call successors, (0), 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-03 17:30:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14528 states to 14528 states and 53059 transitions. [2022-03-03 17:30:09,469 INFO L78 Accepts]: Start accepts. Automaton has 14528 states and 53059 transitions. Word has length 124 [2022-03-03 17:30:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:09,469 INFO L470 AbstractCegarLoop]: Abstraction has 14528 states and 53059 transitions. [2022-03-03 17:30:09,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.765432098765432) internal successors, (305), 81 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:30:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 14528 states and 53059 transitions. [2022-03-03 17:30:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:09,495 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:09,495 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:09,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:09,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:09,696 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1356284150, now seen corresponding path program 5 times [2022-03-03 17:30:09,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:09,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015220603] [2022-03-03 17:30:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:09,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:09,942 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-03 17:30:09,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:09,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015220603] [2022-03-03 17:30:09,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015220603] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:09,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311014620] [2022-03-03 17:30:09,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:30:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:09,948 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:09,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-03 17:30:10,050 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:10,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:10,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-03 17:30:10,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:10,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:30:10,763 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-03 17:30:10,890 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-03 17:30:10,969 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-03 17:30:11,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 17:30:11,146 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-03 17:30:11,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:11,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1062) c_~A~0.base))) (+ (* (- 1) (select .cse0 c_~A~0.offset)) c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) c_~res2~0))) 0)) is different from false [2022-03-03 17:30:11,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1062 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1061) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1062) c_~A~0.base))) (+ c_~res1~0 (* (- 1) (select .cse0 c_~A~0.offset)) (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (* (- 1) c_~res2~0))) 0)) is different from false [2022-03-03 17:30:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-03 17:30:11,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311014620] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:11,416 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:11,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24, 13] total 39 [2022-03-03 17:30:11,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435870374] [2022-03-03 17:30:11,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:11,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-03 17:30:11,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-03 17:30:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1161, Unknown=2, NotChecked=142, Total=1482 [2022-03-03 17:30:11,417 INFO L87 Difference]: Start difference. First operand 14528 states and 53059 transitions. Second operand has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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-03 17:30:12,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:12,603 INFO L93 Difference]: Finished difference Result 24336 states and 88625 transitions. [2022-03-03 17:30:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 17:30:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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 124 [2022-03-03 17:30:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:12,663 INFO L225 Difference]: With dead ends: 24336 [2022-03-03 17:30:12,663 INFO L226 Difference]: Without dead ends: 24186 [2022-03-03 17:30:12,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 226 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=2965, Unknown=2, NotChecked=230, Total=3660 [2022-03-03 17:30:12,664 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 1304 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 3176 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 659 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:12,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1304 Valid, 3176 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 659 Unchecked, 0.5s Time] [2022-03-03 17:30:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24186 states. [2022-03-03 17:30:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24186 to 15188. [2022-03-03 17:30:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15188 states, 15187 states have (on average 3.6518733127016527) internal successors, (55461), 15187 states have internal predecessors, (55461), 0 states have call successors, (0), 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-03 17:30:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15188 states to 15188 states and 55461 transitions. [2022-03-03 17:30:13,006 INFO L78 Accepts]: Start accepts. Automaton has 15188 states and 55461 transitions. Word has length 124 [2022-03-03 17:30:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:13,007 INFO L470 AbstractCegarLoop]: Abstraction has 15188 states and 55461 transitions. [2022-03-03 17:30:13,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.256410256410256) internal successors, (283), 39 states have internal predecessors, (283), 0 states have call successors, (0), 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-03 17:30:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15188 states and 55461 transitions. [2022-03-03 17:30:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:13,034 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:13,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:13,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:13,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:13,235 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1830773178, now seen corresponding path program 6 times [2022-03-03 17:30:13,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:13,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658072963] [2022-03-03 17:30:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:13,478 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-03 17:30:13,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:13,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658072963] [2022-03-03 17:30:13,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658072963] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:13,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123168776] [2022-03-03 17:30:13,479 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:30:13,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:13,480 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:13,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-03 17:30:13,701 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-03 17:30:13,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:13,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-03 17:30:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:14,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-03 17:30:14,137 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-03 17:30:14,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:14,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:14,207 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 27 treesize of output 28 [2022-03-03 17:30:14,388 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-03 17:30:14,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123168776] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:14,388 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:14,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-03-03 17:30:14,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725142659] [2022-03-03 17:30:14,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:14,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-03 17:30:14,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-03 17:30:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-03-03 17:30:14,389 INFO L87 Difference]: Start difference. First operand 15188 states and 55461 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:15,251 INFO L93 Difference]: Finished difference Result 35417 states and 128836 transitions. [2022-03-03 17:30:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-03 17:30:15,251 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-03 17:30:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:15,350 INFO L225 Difference]: With dead ends: 35417 [2022-03-03 17:30:15,350 INFO L226 Difference]: Without dead ends: 35267 [2022-03-03 17:30:15,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=2354, Unknown=0, NotChecked=0, Total=2756 [2022-03-03 17:30:15,351 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 1370 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:15,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1370 Valid, 2908 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 17:30:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35267 states. [2022-03-03 17:30:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35267 to 15372. [2022-03-03 17:30:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15372 states, 15371 states have (on average 3.6530479474334787) internal successors, (56151), 15371 states have internal predecessors, (56151), 0 states have call successors, (0), 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-03 17:30:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15372 states to 15372 states and 56151 transitions. [2022-03-03 17:30:15,797 INFO L78 Accepts]: Start accepts. Automaton has 15372 states and 56151 transitions. Word has length 124 [2022-03-03 17:30:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:15,797 INFO L470 AbstractCegarLoop]: Abstraction has 15372 states and 56151 transitions. [2022-03-03 17:30:15,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 15372 states and 56151 transitions. [2022-03-03 17:30:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:15,825 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:15,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:15,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:16,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:16,026 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1266592118, now seen corresponding path program 7 times [2022-03-03 17:30:16,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:16,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563412103] [2022-03-03 17:30:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:16,252 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-03 17:30:16,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:16,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563412103] [2022-03-03 17:30:16,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563412103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:16,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573295273] [2022-03-03 17:30:16,252 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:30:16,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:16,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:16,254 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:16,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-03 17:30:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:16,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-03 17:30:16,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:16,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-03 17:30:16,798 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-03 17:30:16,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:16,868 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:16,868 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 27 treesize of output 28 [2022-03-03 17:30:17,048 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-03 17:30:17,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573295273] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:17,048 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:17,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 11] total 26 [2022-03-03 17:30:17,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350228748] [2022-03-03 17:30:17,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:17,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-03 17:30:17,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-03 17:30:17,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-03-03 17:30:17,049 INFO L87 Difference]: Start difference. First operand 15372 states and 56151 transitions. Second operand has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:30:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:17,892 INFO L93 Difference]: Finished difference Result 31445 states and 114553 transitions. [2022-03-03 17:30:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-03 17:30:17,893 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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 124 [2022-03-03 17:30:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:18,086 INFO L225 Difference]: With dead ends: 31445 [2022-03-03 17:30:18,087 INFO L226 Difference]: Without dead ends: 31295 [2022-03-03 17:30:18,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 239 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2022-03-03 17:30:18,087 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 785 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:18,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [785 Valid, 3509 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 17:30:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31295 states. [2022-03-03 17:30:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31295 to 15296. [2022-03-03 17:30:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15296 states, 15295 states have (on average 3.65289310232102) internal successors, (55871), 15295 states have internal predecessors, (55871), 0 states have call successors, (0), 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-03 17:30:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15296 states to 15296 states and 55871 transitions. [2022-03-03 17:30:18,470 INFO L78 Accepts]: Start accepts. Automaton has 15296 states and 55871 transitions. Word has length 124 [2022-03-03 17:30:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:18,470 INFO L470 AbstractCegarLoop]: Abstraction has 15296 states and 55871 transitions. [2022-03-03 17:30:18,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.115384615384615) internal successors, (263), 26 states have internal predecessors, (263), 0 states have call successors, (0), 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-03 17:30:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15296 states and 55871 transitions. [2022-03-03 17:30:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:18,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:18,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:18,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:18,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-03 17:30:18,699 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash 78530768, now seen corresponding path program 8 times [2022-03-03 17:30:18,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:18,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455060836] [2022-03-03 17:30:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:18,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:18,919 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-03 17:30:18,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:18,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455060836] [2022-03-03 17:30:18,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455060836] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:18,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365649848] [2022-03-03 17:30:18,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:30:18,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:18,921 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-03 17:30:19,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:19,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:19,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-03 17:30:19,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:19,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-03-03 17:30:19,485 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-03 17:30:19,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:19,555 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:19,555 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 27 treesize of output 28 [2022-03-03 17:30:19,732 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-03 17:30:19,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365649848] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:19,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:19,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 24 [2022-03-03 17:30:19,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175927753] [2022-03-03 17:30:19,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:19,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-03 17:30:19,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-03 17:30:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-03-03 17:30:19,733 INFO L87 Difference]: Start difference. First operand 15296 states and 55871 transitions. Second operand has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:20,659 INFO L93 Difference]: Finished difference Result 38199 states and 138740 transitions. [2022-03-03 17:30:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-03 17:30:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-03-03 17:30:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:20,770 INFO L225 Difference]: With dead ends: 38199 [2022-03-03 17:30:20,771 INFO L226 Difference]: Without dead ends: 38049 [2022-03-03 17:30:20,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=359, Invalid=2191, Unknown=0, NotChecked=0, Total=2550 [2022-03-03 17:30:20,771 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 1200 mSDsluCounter, 3167 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:20,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 3215 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-03 17:30:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38049 states. [2022-03-03 17:30:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38049 to 15320. [2022-03-03 17:30:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15320 states, 15319 states have (on average 3.6550688687251127) internal successors, (55992), 15319 states have internal predecessors, (55992), 0 states have call successors, (0), 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-03 17:30:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15320 states to 15320 states and 55992 transitions. [2022-03-03 17:30:21,361 INFO L78 Accepts]: Start accepts. Automaton has 15320 states and 55992 transitions. Word has length 124 [2022-03-03 17:30:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:21,362 INFO L470 AbstractCegarLoop]: Abstraction has 15320 states and 55992 transitions. [2022-03-03 17:30:21,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 8.958333333333334) internal successors, (215), 24 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-03 17:30:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 15320 states and 55992 transitions. [2022-03-03 17:30:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:21,389 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:21,389 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:21,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:21,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-03 17:30:21,589 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:21,590 INFO L85 PathProgramCache]: Analyzing trace with hash 416009350, now seen corresponding path program 9 times [2022-03-03 17:30:21,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:21,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253645408] [2022-03-03 17:30:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:21,812 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-03 17:30:21,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:21,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253645408] [2022-03-03 17:30:21,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253645408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:21,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584419534] [2022-03-03 17:30:21,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:30:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:21,814 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:21,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-03 17:30:21,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:30:21,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:21,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 51 conjunts are in the unsatisfiable core [2022-03-03 17:30:21,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:22,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-03-03 17:30:22,380 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-03 17:30:22,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:22,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:22,463 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 27 treesize of output 28 [2022-03-03 17:30:22,641 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-03 17:30:22,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584419534] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:22,642 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:22,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 11] total 25 [2022-03-03 17:30:22,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355058812] [2022-03-03 17:30:22,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:22,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-03 17:30:22,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-03 17:30:22,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2022-03-03 17:30:22,643 INFO L87 Difference]: Start difference. First operand 15320 states and 55992 transitions. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 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-03 17:30:23,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:23,486 INFO L93 Difference]: Finished difference Result 30271 states and 110000 transitions. [2022-03-03 17:30:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-03 17:30:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 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) Word has length 124 [2022-03-03 17:30:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:23,570 INFO L225 Difference]: With dead ends: 30271 [2022-03-03 17:30:23,570 INFO L226 Difference]: Without dead ends: 30121 [2022-03-03 17:30:23,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 239 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-03-03 17:30:23,571 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 791 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:23,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 3074 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-03 17:30:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30121 states. [2022-03-03 17:30:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30121 to 15390. [2022-03-03 17:30:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15390 states, 15389 states have (on average 3.650139710182598) internal successors, (56172), 15389 states have internal predecessors, (56172), 0 states have call successors, (0), 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-03 17:30:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 56172 transitions. [2022-03-03 17:30:23,972 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 56172 transitions. Word has length 124 [2022-03-03 17:30:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:23,972 INFO L470 AbstractCegarLoop]: Abstraction has 15390 states and 56172 transitions. [2022-03-03 17:30:23,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 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-03 17:30:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 56172 transitions. [2022-03-03 17:30:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:24,000 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:24,000 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:24,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:24,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:24,203 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1308591088, now seen corresponding path program 17 times [2022-03-03 17:30:24,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:24,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679449480] [2022-03-03 17:30:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:24,888 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-03 17:30:24,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:24,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679449480] [2022-03-03 17:30:24,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679449480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:24,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818220589] [2022-03-03 17:30:24,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:30:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:24,889 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:24,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-03 17:30:24,997 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:30:24,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:24,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 17:30:25,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:25,926 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:25,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-03-03 17:30:26,126 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-03 17:30:26,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:26,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:26,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:30:27,029 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-03 17:30:27,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818220589] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:27,030 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:27,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 60 [2022-03-03 17:30:27,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387648053] [2022-03-03 17:30:27,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:27,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-03 17:30:27,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:27,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-03 17:30:27,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3062, Unknown=0, NotChecked=0, Total=3540 [2022-03-03 17:30:27,031 INFO L87 Difference]: Start difference. First operand 15390 states and 56172 transitions. Second operand has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 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-03 17:30:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:28,965 INFO L93 Difference]: Finished difference Result 27927 states and 102492 transitions. [2022-03-03 17:30:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-03 17:30:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 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 124 [2022-03-03 17:30:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:29,045 INFO L225 Difference]: With dead ends: 27927 [2022-03-03 17:30:29,045 INFO L226 Difference]: Without dead ends: 27777 [2022-03-03 17:30:29,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3056 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1044, Invalid=6266, Unknown=0, NotChecked=0, Total=7310 [2022-03-03 17:30:29,046 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 1672 mSDsluCounter, 5940 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 5746 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 806 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:29,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 5746 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2260 Invalid, 0 Unknown, 806 Unchecked, 0.9s Time] [2022-03-03 17:30:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27777 states. [2022-03-03 17:30:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27777 to 15390. [2022-03-03 17:30:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15390 states, 15389 states have (on average 3.650139710182598) internal successors, (56172), 15389 states have internal predecessors, (56172), 0 states have call successors, (0), 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-03 17:30:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15390 states to 15390 states and 56172 transitions. [2022-03-03 17:30:29,512 INFO L78 Accepts]: Start accepts. Automaton has 15390 states and 56172 transitions. Word has length 124 [2022-03-03 17:30:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:29,512 INFO L470 AbstractCegarLoop]: Abstraction has 15390 states and 56172 transitions. [2022-03-03 17:30:29,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 4.65) internal successors, (279), 60 states have internal predecessors, (279), 0 states have call successors, (0), 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-03 17:30:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15390 states and 56172 transitions. [2022-03-03 17:30:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:29,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:29,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:29,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:29,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-03 17:30:29,742 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1336949438, now seen corresponding path program 18 times [2022-03-03 17:30:29,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:29,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194103320] [2022-03-03 17:30:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:30,151 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-03 17:30:30,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:30,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194103320] [2022-03-03 17:30:30,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194103320] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:30,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805561686] [2022-03-03 17:30:30,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:30:30,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:30,168 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-03 17:30:30,283 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-03 17:30:30,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:30:30,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-03 17:30:30,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:30,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:30,692 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 27 treesize of output 27 [2022-03-03 17:30:31,061 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-03 17:30:31,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:30:31,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:31,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:30:31,751 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-03 17:30:31,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805561686] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:30:31,751 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:30:31,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 17] total 46 [2022-03-03 17:30:31,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294924596] [2022-03-03 17:30:31,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:30:31,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-03 17:30:31,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:30:31,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-03 17:30:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1774, Unknown=0, NotChecked=0, Total=2070 [2022-03-03 17:30:31,753 INFO L87 Difference]: Start difference. First operand 15390 states and 56172 transitions. Second operand has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 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-03 17:30:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:30:55,492 INFO L93 Difference]: Finished difference Result 90475 states and 330820 transitions. [2022-03-03 17:30:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 383 states. [2022-03-03 17:30:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 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 124 [2022-03-03 17:30:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:30:55,963 INFO L225 Difference]: With dead ends: 90475 [2022-03-03 17:30:55,963 INFO L226 Difference]: Without dead ends: 90325 [2022-03-03 17:30:55,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 7 DeprecatedPredicates, 74627 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=17315, Invalid=147927, Unknown=0, NotChecked=0, Total=165242 [2022-03-03 17:30:55,969 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 3121 mSDsluCounter, 13788 mSDsCounter, 0 mSdLazyCounter, 7617 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 12621 SdHoareTripleChecker+Invalid, 16624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 7617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8685 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:30:55,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3121 Valid, 12621 Invalid, 16624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 7617 Invalid, 0 Unknown, 8685 Unchecked, 3.6s Time] [2022-03-03 17:30:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90325 states. [2022-03-03 17:30:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90325 to 15607. [2022-03-03 17:30:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15607 states, 15606 states have (on average 3.666794822504165) internal successors, (57224), 15606 states have internal predecessors, (57224), 0 states have call successors, (0), 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-03 17:30:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 57224 transitions. [2022-03-03 17:30:57,093 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 57224 transitions. Word has length 124 [2022-03-03 17:30:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:30:57,093 INFO L470 AbstractCegarLoop]: Abstraction has 15607 states and 57224 transitions. [2022-03-03 17:30:57,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 6.326086956521739) internal successors, (291), 46 states have internal predecessors, (291), 0 states have call successors, (0), 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-03 17:30:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 57224 transitions. [2022-03-03 17:30:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:30:57,125 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:30:57,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:30:57,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-03-03 17:30:57,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-03 17:30:57,326 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:30:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:30:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1021856560, now seen corresponding path program 19 times [2022-03-03 17:30:57,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:30:57,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358366414] [2022-03-03 17:30:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:30:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:30:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:57,852 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-03 17:30:57,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:30:57,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358366414] [2022-03-03 17:30:57,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358366414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:30:57,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692762393] [2022-03-03 17:30:57,853 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:30:57,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:30:57,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:30:57,854 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:30:57,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-03 17:30:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:30:57,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-03 17:30:57,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:30:58,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:30:58,473 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:30:58,473 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 11 treesize of output 11 [2022-03-03 17:30:58,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:30:59,132 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-03 17:30:59,300 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-03 17:30:59,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 17:30:59,565 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:30:59,565 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 27 treesize of output 27 [2022-03-03 17:30:59,962 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-03 17:30:59,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:00,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-03 17:31:00,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-03 17:31:00,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-03 17:31:00,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-03 17:31:00,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:31:00,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-03 17:31:00,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1291 (Array Int Int)) (v_ArrVal_1290 (Array Int Int)) (~M~0 Int) (v_ArrVal_1292 (Array Int Int))) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1290) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-03 17:31:00,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,764 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 61 treesize of output 50 [2022-03-03 17:31:00,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,773 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 398 treesize of output 386 [2022-03-03 17:31:00,781 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,781 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 374 treesize of output 354 [2022-03-03 17:31:00,789 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,790 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 342 treesize of output 290 [2022-03-03 17:31:00,800 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:00,800 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 146 treesize of output 143 [2022-03-03 17:31:01,847 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 10 treesize of output 8 [2022-03-03 17:31:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:31:01,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692762393] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:01,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:01,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 76 [2022-03-03 17:31:01,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599367088] [2022-03-03 17:31:01,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:01,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-03 17:31:01,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-03 17:31:01,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=4074, Unknown=9, NotChecked=980, Total=5700 [2022-03-03 17:31:01,871 INFO L87 Difference]: Start difference. First operand 15607 states and 57224 transitions. Second operand has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 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-03 17:31:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:05,557 INFO L93 Difference]: Finished difference Result 34201 states and 124791 transitions. [2022-03-03 17:31:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-03 17:31:05,557 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 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 124 [2022-03-03 17:31:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:05,661 INFO L225 Difference]: With dead ends: 34201 [2022-03-03 17:31:05,662 INFO L226 Difference]: Without dead ends: 34162 [2022-03-03 17:31:05,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 211 SyntacticMatches, 13 SemanticMatches, 119 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4987 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1446, Invalid=11455, Unknown=9, NotChecked=1610, Total=14520 [2022-03-03 17:31:05,663 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1597 mSDsluCounter, 8940 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 8752 SdHoareTripleChecker+Invalid, 5913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3441 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:05,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1597 Valid, 8752 Invalid, 5913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2452 Invalid, 0 Unknown, 3441 Unchecked, 1.0s Time] [2022-03-03 17:31:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34162 states. [2022-03-03 17:31:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34162 to 17028. [2022-03-03 17:31:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17028 states, 17027 states have (on average 3.681564573912022) internal successors, (62686), 17027 states have internal predecessors, (62686), 0 states have call successors, (0), 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-03 17:31:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17028 states to 17028 states and 62686 transitions. [2022-03-03 17:31:06,257 INFO L78 Accepts]: Start accepts. Automaton has 17028 states and 62686 transitions. Word has length 124 [2022-03-03 17:31:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:06,257 INFO L470 AbstractCegarLoop]: Abstraction has 17028 states and 62686 transitions. [2022-03-03 17:31:06,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.9473684210526314) internal successors, (300), 76 states have internal predecessors, (300), 0 states have call successors, (0), 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-03 17:31:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17028 states and 62686 transitions. [2022-03-03 17:31:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:31:06,287 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:06,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-03 17:31:06,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-03 17:31:06,487 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:31:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1071096070, now seen corresponding path program 20 times [2022-03-03 17:31:06,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:06,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899175778] [2022-03-03 17:31:06,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:06,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:07,004 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-03 17:31:07,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:07,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899175778] [2022-03-03 17:31:07,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899175778] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:31:07,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930341973] [2022-03-03 17:31:07,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:31:07,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:07,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:07,006 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:31:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-03 17:31:07,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:31:07,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:31:07,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-03 17:31:07,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:31:07,717 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:07,718 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 21 treesize of output 21 [2022-03-03 17:31:08,116 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-03 17:31:08,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:08,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:08,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:31:08,774 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-03 17:31:08,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930341973] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:08,774 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:08,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 55 [2022-03-03 17:31:08,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659166665] [2022-03-03 17:31:08,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:08,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-03 17:31:08,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:08,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-03 17:31:08,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2022-03-03 17:31:08,776 INFO L87 Difference]: Start difference. First operand 17028 states and 62686 transitions. Second operand has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 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-03 17:31:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:31:41,783 INFO L93 Difference]: Finished difference Result 113072 states and 415075 transitions. [2022-03-03 17:31:41,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 541 states. [2022-03-03 17:31:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 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 124 [2022-03-03 17:31:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:31:42,458 INFO L225 Difference]: With dead ends: 113072 [2022-03-03 17:31:42,459 INFO L226 Difference]: Without dead ends: 112622 [2022-03-03 17:31:42,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 223 SyntacticMatches, 9 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153788 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=28496, Invalid=301554, Unknown=0, NotChecked=0, Total=330050 [2022-03-03 17:31:42,470 INFO L933 BasicCegarLoop]: 605 mSDtfsCounter, 4205 mSDsluCounter, 16337 mSDsCounter, 0 mSdLazyCounter, 12218 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 15419 SdHoareTripleChecker+Invalid, 15061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 12218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2407 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:31:42,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4205 Valid, 15419 Invalid, 15061 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [436 Valid, 12218 Invalid, 0 Unknown, 2407 Unchecked, 5.6s Time] [2022-03-03 17:31:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112622 states. [2022-03-03 17:31:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112622 to 15658. [2022-03-03 17:31:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15658 states, 15657 states have (on average 3.6551702114070386) internal successors, (57229), 15657 states have internal predecessors, (57229), 0 states have call successors, (0), 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-03 17:31:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15658 states to 15658 states and 57229 transitions. [2022-03-03 17:31:43,801 INFO L78 Accepts]: Start accepts. Automaton has 15658 states and 57229 transitions. Word has length 124 [2022-03-03 17:31:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:31:43,801 INFO L470 AbstractCegarLoop]: Abstraction has 15658 states and 57229 transitions. [2022-03-03 17:31:43,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.5636363636363635) internal successors, (306), 55 states have internal predecessors, (306), 0 states have call successors, (0), 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-03 17:31:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states and 57229 transitions. [2022-03-03 17:31:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:31:43,832 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:31:43,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:31:43,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-03 17:31:44,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:44,035 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:31:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:31:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 677970192, now seen corresponding path program 21 times [2022-03-03 17:31:44,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:31:44,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624217512] [2022-03-03 17:31:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:31:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:31:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:31:44,548 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-03 17:31:44,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:31:44,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624217512] [2022-03-03 17:31:44,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624217512] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:31:44,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428336897] [2022-03-03 17:31:44,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:31:44,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:31:44,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:31:44,550 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:31:44,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-03 17:31:44,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 17:31:44,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:31:44,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-03 17:31:44,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:31:45,123 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:45,123 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 27 treesize of output 27 [2022-03-03 17:31:45,625 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-03 17:31:45,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:31:45,931 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:31:45,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:31:46,307 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-03 17:31:46,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428336897] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:31:46,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:31:46,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-03 17:31:46,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694787996] [2022-03-03 17:31:46,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:31:46,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-03 17:31:46,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:31:46,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-03 17:31:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=2278, Unknown=0, NotChecked=0, Total=2550 [2022-03-03 17:31:46,309 INFO L87 Difference]: Start difference. First operand 15658 states and 57229 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:32:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:32:20,592 INFO L93 Difference]: Finished difference Result 106487 states and 390266 transitions. [2022-03-03 17:32:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 514 states. [2022-03-03 17:32:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:32:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:32:21,275 INFO L225 Difference]: With dead ends: 106487 [2022-03-03 17:32:21,275 INFO L226 Difference]: Without dead ends: 106037 [2022-03-03 17:32:21,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 235 SyntacticMatches, 4 SemanticMatches, 540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132190 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=27373, Invalid=265849, Unknown=0, NotChecked=0, Total=293222 [2022-03-03 17:32:21,289 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 3882 mSDsluCounter, 17308 mSDsCounter, 0 mSdLazyCounter, 10563 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3882 SdHoareTripleChecker+Valid, 16497 SdHoareTripleChecker+Invalid, 18436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 10563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7453 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:32:21,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3882 Valid, 16497 Invalid, 18436 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [420 Valid, 10563 Invalid, 0 Unknown, 7453 Unchecked, 4.8s Time] [2022-03-03 17:32:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106037 states. [2022-03-03 17:32:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106037 to 16138. [2022-03-03 17:32:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16138 states, 16137 states have (on average 3.673111482927434) internal successors, (59273), 16137 states have internal predecessors, (59273), 0 states have call successors, (0), 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-03 17:32:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16138 states to 16138 states and 59273 transitions. [2022-03-03 17:32:22,752 INFO L78 Accepts]: Start accepts. Automaton has 16138 states and 59273 transitions. Word has length 124 [2022-03-03 17:32:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:32:22,753 INFO L470 AbstractCegarLoop]: Abstraction has 16138 states and 59273 transitions. [2022-03-03 17:32:22,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:32:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 59273 transitions. [2022-03-03 17:32:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:32:22,785 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:32:22,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:32:22,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-03 17:32:22,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:22,986 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:32:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2092648740, now seen corresponding path program 22 times [2022-03-03 17:32:22,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:22,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709332415] [2022-03-03 17:32:22,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:23,557 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-03 17:32:23,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:23,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709332415] [2022-03-03 17:32:23,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709332415] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:23,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142524169] [2022-03-03 17:32:23,557 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:32:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:23,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:23,558 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:32:23,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-03 17:32:23,674 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:32:23,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:32:23,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 61 conjunts are in the unsatisfiable core [2022-03-03 17:32:23,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:24,427 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:24,427 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 27 treesize of output 27 [2022-03-03 17:32:24,745 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-03 17:32:24,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:24,951 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:24,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:32:25,677 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-03 17:32:25,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142524169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:32:25,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:32:25,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 22] total 57 [2022-03-03 17:32:25,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822276864] [2022-03-03 17:32:25,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:32:25,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-03 17:32:25,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:32:25,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-03 17:32:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2825, Unknown=0, NotChecked=0, Total=3192 [2022-03-03 17:32:25,679 INFO L87 Difference]: Start difference. First operand 16138 states and 59273 transitions. Second operand has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 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-03 17:32:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:32:30,449 INFO L93 Difference]: Finished difference Result 42115 states and 154292 transitions. [2022-03-03 17:32:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-03 17:32:30,449 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 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 124 [2022-03-03 17:32:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:32:30,584 INFO L225 Difference]: With dead ends: 42115 [2022-03-03 17:32:30,584 INFO L226 Difference]: Without dead ends: 41965 [2022-03-03 17:32:30,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 221 SyntacticMatches, 15 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7211 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2174, Invalid=17008, Unknown=0, NotChecked=0, Total=19182 [2022-03-03 17:32:30,585 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 2975 mSDsluCounter, 7289 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 6957 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2152 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:32:30,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2975 Valid, 6957 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2259 Invalid, 0 Unknown, 2152 Unchecked, 1.0s Time] [2022-03-03 17:32:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41965 states. [2022-03-03 17:32:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41965 to 15942. [2022-03-03 17:32:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15942 states, 15941 states have (on average 3.663634652782134) internal successors, (58402), 15941 states have internal predecessors, (58402), 0 states have call successors, (0), 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-03 17:32:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 58402 transitions. [2022-03-03 17:32:31,248 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 58402 transitions. Word has length 124 [2022-03-03 17:32:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:32:31,248 INFO L470 AbstractCegarLoop]: Abstraction has 15942 states and 58402 transitions. [2022-03-03 17:32:31,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.894736842105263) internal successors, (279), 57 states have internal predecessors, (279), 0 states have call successors, (0), 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-03 17:32:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 58402 transitions. [2022-03-03 17:32:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:32:31,281 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:32:31,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:32:31,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-03 17:32:31,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-03-03 17:32:31,482 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:32:31,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:31,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1474847118, now seen corresponding path program 23 times [2022-03-03 17:32:31,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:31,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138135849] [2022-03-03 17:32:31,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:31,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:31,974 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-03 17:32:31,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:31,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138135849] [2022-03-03 17:32:31,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138135849] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:31,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501791641] [2022-03-03 17:32:31,975 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:32:31,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:31,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:31,976 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:32:31,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-03 17:32:32,089 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:32:32,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:32:32,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-03 17:32:32,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:32,696 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-03 17:32:33,184 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-03 17:32:33,410 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-03 17:32:33,532 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-03 17:32:33,701 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:33,702 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 21 treesize of output 21 [2022-03-03 17:32:33,951 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-03 17:32:33,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:34,403 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1425 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:32:34,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:32:34,508 WARN L838 $PredicateComparison]: unable to prove that (or (not (< |c_thread1Thread1of1ForFork0_~i~0#1| c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:34,522 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 c_~A~0.offset) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:34,547 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:32:34,670 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (not (< 0 c_~N~0))) is different from false [2022-03-03 17:32:34,696 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:34,711 WARN L838 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1424) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1425) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-03-03 17:32:34,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:34,965 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 61 treesize of output 50 [2022-03-03 17:32:34,972 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:34,973 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 398 treesize of output 386 [2022-03-03 17:32:34,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:34,982 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 374 treesize of output 354 [2022-03-03 17:32:34,991 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:34,991 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 342 treesize of output 290 [2022-03-03 17:32:35,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:35,003 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 146 treesize of output 143 [2022-03-03 17:32:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:32:35,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501791641] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:32:35,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:32:35,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 76 [2022-03-03 17:32:35,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752969241] [2022-03-03 17:32:35,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:32:35,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-03-03 17:32:35,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:32:35,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-03-03 17:32:35,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=456, Invalid=4122, Unknown=10, NotChecked=1112, Total=5700 [2022-03-03 17:32:35,867 INFO L87 Difference]: Start difference. First operand 15942 states and 58402 transitions. Second operand has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 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-03 17:32:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:32:45,397 INFO L93 Difference]: Finished difference Result 38774 states and 140671 transitions. [2022-03-03 17:32:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-03 17:32:45,398 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 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 124 [2022-03-03 17:32:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:32:45,529 INFO L225 Difference]: With dead ends: 38774 [2022-03-03 17:32:45,530 INFO L226 Difference]: Without dead ends: 38624 [2022-03-03 17:32:45,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 4793 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1497, Invalid=13531, Unknown=10, NotChecked=1992, Total=17030 [2022-03-03 17:32:45,531 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 2103 mSDsluCounter, 10527 mSDsCounter, 0 mSdLazyCounter, 4512 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 10018 SdHoareTripleChecker+Invalid, 9086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 4512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4487 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-03 17:32:45,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2103 Valid, 10018 Invalid, 9086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 4512 Invalid, 0 Unknown, 4487 Unchecked, 1.8s Time] [2022-03-03 17:32:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38624 states. [2022-03-03 17:32:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38624 to 15878. [2022-03-03 17:32:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 3.661271020973736) internal successors, (58130), 15877 states have internal predecessors, (58130), 0 states have call successors, (0), 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-03 17:32:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 58130 transitions. [2022-03-03 17:32:46,082 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 58130 transitions. Word has length 124 [2022-03-03 17:32:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:32:46,082 INFO L470 AbstractCegarLoop]: Abstraction has 15878 states and 58130 transitions. [2022-03-03 17:32:46,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 3.8289473684210527) internal successors, (291), 76 states have internal predecessors, (291), 0 states have call successors, (0), 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-03 17:32:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 58130 transitions. [2022-03-03 17:32:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:32:46,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:32:46,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:32:46,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-03 17:32:46,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-03 17:32:46,314 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:32:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:32:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1934802414, now seen corresponding path program 24 times [2022-03-03 17:32:46,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:32:46,315 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599663992] [2022-03-03 17:32:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:32:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:32:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:32:46,824 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-03 17:32:46,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:32:46,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599663992] [2022-03-03 17:32:46,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599663992] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:32:46,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545453031] [2022-03-03 17:32:46,824 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:32:46,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:32:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:32:46,825 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:32:46,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-03 17:32:46,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:32:46,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:32:46,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-03 17:32:46,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:32:47,381 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:47,382 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 27 treesize of output 27 [2022-03-03 17:32:47,695 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-03 17:32:47,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:32:48,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:32:48,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:32:48,488 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-03 17:32:48,489 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545453031] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:32:48,489 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:32:48,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-03 17:32:48,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166257697] [2022-03-03 17:32:48,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:32:48,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-03 17:32:48,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:32:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-03 17:32:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2260, Unknown=0, NotChecked=0, Total=2550 [2022-03-03 17:32:48,490 INFO L87 Difference]: Start difference. First operand 15878 states and 58130 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:33:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:33:10,030 INFO L93 Difference]: Finished difference Result 90071 states and 329478 transitions. [2022-03-03 17:33:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 386 states. [2022-03-03 17:33:10,030 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:33:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:33:10,684 INFO L225 Difference]: With dead ends: 90071 [2022-03-03 17:33:10,684 INFO L226 Difference]: Without dead ends: 89651 [2022-03-03 17:33:10,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 235 SyntacticMatches, 13 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76682 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=16993, Invalid=153163, Unknown=0, NotChecked=0, Total=170156 [2022-03-03 17:33:10,690 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 3524 mSDsluCounter, 15132 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3524 SdHoareTripleChecker+Valid, 14346 SdHoareTripleChecker+Invalid, 20261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12746 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:33:10,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3524 Valid, 14346 Invalid, 20261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 7185 Invalid, 0 Unknown, 12746 Unchecked, 3.4s Time] [2022-03-03 17:33:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89651 states. [2022-03-03 17:33:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89651 to 16366. [2022-03-03 17:33:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16366 states, 16365 states have (on average 3.6739382829208678) internal successors, (60124), 16365 states have internal predecessors, (60124), 0 states have call successors, (0), 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-03 17:33:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16366 states to 16366 states and 60124 transitions. [2022-03-03 17:33:11,874 INFO L78 Accepts]: Start accepts. Automaton has 16366 states and 60124 transitions. Word has length 124 [2022-03-03 17:33:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:33:11,874 INFO L470 AbstractCegarLoop]: Abstraction has 16366 states and 60124 transitions. [2022-03-03 17:33:11,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:33:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16366 states and 60124 transitions. [2022-03-03 17:33:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:33:11,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:33:11,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:33:11,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-03-03 17:33:12,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-03 17:33:12,107 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:33:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:33:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -945486334, now seen corresponding path program 25 times [2022-03-03 17:33:12,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:33:12,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940577529] [2022-03-03 17:33:12,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:33:12,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:33:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:33:12,686 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-03 17:33:12,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:33:12,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940577529] [2022-03-03 17:33:12,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940577529] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:33:12,686 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257939790] [2022-03-03 17:33:12,686 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:33:12,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:12,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:33:12,688 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:33:12,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-03 17:33:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:33:12,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-03-03 17:33:12,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:33:12,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:33:13,225 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-03-03 17:33:13,231 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 11 treesize of output 11 [2022-03-03 17:33:13,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-03-03 17:33:13,949 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-03 17:33:14,118 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-03 17:33:14,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:33:14,384 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:14,384 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 27 treesize of output 27 [2022-03-03 17:33:14,741 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-03 17:33:14,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:33:15,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-03 17:33:15,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))))) is different from false [2022-03-03 17:33:15,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))))) is different from false [2022-03-03 17:33:15,271 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-03 17:33:15,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:33:15,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-03-03 17:33:15,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1495 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1495) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) is different from false [2022-03-03 17:33:15,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:15,632 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 61 treesize of output 50 [2022-03-03 17:33:15,639 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:15,640 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 398 treesize of output 386 [2022-03-03 17:33:15,654 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:15,654 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 374 treesize of output 322 [2022-03-03 17:33:15,663 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:15,663 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 310 treesize of output 306 [2022-03-03 17:33:15,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:15,672 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 294 treesize of output 274 [2022-03-03 17:33:16,679 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 10 treesize of output 8 [2022-03-03 17:33:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:33:16,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257939790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:33:16,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:33:16,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 31] total 79 [2022-03-03 17:33:16,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665513494] [2022-03-03 17:33:16,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:33:16,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-03 17:33:16,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:33:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-03 17:33:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=4512, Unknown=9, NotChecked=1022, Total=6162 [2022-03-03 17:33:16,703 INFO L87 Difference]: Start difference. First operand 16366 states and 60124 transitions. Second operand has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:33:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:33:22,630 INFO L93 Difference]: Finished difference Result 45363 states and 165251 transitions. [2022-03-03 17:33:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-03-03 17:33:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-03-03 17:33:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:33:22,767 INFO L225 Difference]: With dead ends: 45363 [2022-03-03 17:33:22,767 INFO L226 Difference]: Without dead ends: 45063 [2022-03-03 17:33:22,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 205 SyntacticMatches, 13 SemanticMatches, 152 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 8098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2184, Invalid=19297, Unknown=9, NotChecked=2072, Total=23562 [2022-03-03 17:33:22,768 INFO L933 BasicCegarLoop]: 307 mSDtfsCounter, 2933 mSDsluCounter, 10236 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2933 SdHoareTripleChecker+Valid, 9599 SdHoareTripleChecker+Invalid, 9850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6493 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:33:22,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2933 Valid, 9599 Invalid, 9850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 3262 Invalid, 0 Unknown, 6493 Unchecked, 1.4s Time] [2022-03-03 17:33:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45063 states. [2022-03-03 17:33:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45063 to 15874. [2022-03-03 17:33:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15874 states, 15873 states have (on average 3.662256662256662) internal successors, (58131), 15873 states have internal predecessors, (58131), 0 states have call successors, (0), 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-03 17:33:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15874 states to 15874 states and 58131 transitions. [2022-03-03 17:33:23,275 INFO L78 Accepts]: Start accepts. Automaton has 15874 states and 58131 transitions. Word has length 124 [2022-03-03 17:33:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:33:23,276 INFO L470 AbstractCegarLoop]: Abstraction has 15874 states and 58131 transitions. [2022-03-03 17:33:23,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.8607594936708862) internal successors, (305), 79 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:33:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 15874 states and 58131 transitions. [2022-03-03 17:33:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:33:23,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:33:23,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:33:23,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-03 17:33:23,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-03 17:33:23,505 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:33:23,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:33:23,505 INFO L85 PathProgramCache]: Analyzing trace with hash 724968554, now seen corresponding path program 26 times [2022-03-03 17:33:23,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:33:23,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199139870] [2022-03-03 17:33:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:33:23,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:33:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:33:23,982 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-03 17:33:23,982 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:33:23,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199139870] [2022-03-03 17:33:23,982 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199139870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:33:23,982 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675002821] [2022-03-03 17:33:23,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:33:23,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:33:23,984 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:33:23,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-03 17:33:24,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:33:24,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:33:24,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-03 17:33:24,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:33:24,797 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:24,797 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 25 treesize of output 25 [2022-03-03 17:33:25,187 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-03 17:33:25,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:33:25,456 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:25,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:33:25,866 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-03 17:33:25,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675002821] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:33:25,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:33:25,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 17] total 56 [2022-03-03 17:33:25,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119505758] [2022-03-03 17:33:25,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:33:25,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-03 17:33:25,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:33:25,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-03 17:33:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=2626, Unknown=0, NotChecked=0, Total=3080 [2022-03-03 17:33:25,868 INFO L87 Difference]: Start difference. First operand 15874 states and 58131 transitions. Second operand has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:33:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:33:50,672 INFO L93 Difference]: Finished difference Result 84822 states and 311994 transitions. [2022-03-03 17:33:50,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2022-03-03 17:33:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:33:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:33:50,989 INFO L225 Difference]: With dead ends: 84822 [2022-03-03 17:33:50,990 INFO L226 Difference]: Without dead ends: 84522 [2022-03-03 17:33:50,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 242 SyntacticMatches, 30 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91356 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=19890, Invalid=170642, Unknown=0, NotChecked=0, Total=190532 [2022-03-03 17:33:50,998 INFO L933 BasicCegarLoop]: 483 mSDtfsCounter, 4029 mSDsluCounter, 12896 mSDsCounter, 0 mSdLazyCounter, 9270 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4029 SdHoareTripleChecker+Valid, 12221 SdHoareTripleChecker+Invalid, 13716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 9270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4091 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:33:50,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4029 Valid, 12221 Invalid, 13716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 9270 Invalid, 0 Unknown, 4091 Unchecked, 4.4s Time] [2022-03-03 17:33:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84522 states. [2022-03-03 17:33:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84522 to 16034. [2022-03-03 17:33:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16034 states, 16033 states have (on average 3.6646292022703175) internal successors, (58755), 16033 states have internal predecessors, (58755), 0 states have call successors, (0), 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-03 17:33:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16034 states to 16034 states and 58755 transitions. [2022-03-03 17:33:52,214 INFO L78 Accepts]: Start accepts. Automaton has 16034 states and 58755 transitions. Word has length 124 [2022-03-03 17:33:52,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:33:52,215 INFO L470 AbstractCegarLoop]: Abstraction has 16034 states and 58755 transitions. [2022-03-03 17:33:52,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 5.482142857142857) internal successors, (307), 56 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:33:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16034 states and 58755 transitions. [2022-03-03 17:33:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:33:52,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:33:52,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:33:52,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-03 17:33:52,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:52,444 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:33:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:33:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 65989308, now seen corresponding path program 27 times [2022-03-03 17:33:52,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:33:52,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790563520] [2022-03-03 17:33:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:33:52,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:33:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:33:53,027 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-03 17:33:53,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:33:53,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790563520] [2022-03-03 17:33:53,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790563520] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:33:53,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645312229] [2022-03-03 17:33:53,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:33:53,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:33:53,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:33:53,029 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:33:53,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-03 17:33:53,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-03 17:33:53,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:33:53,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-03 17:33:53,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:33:53,597 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:53,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:33:53,904 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-03 17:33:53,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:33:54,154 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:33:54,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:33:54,553 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-03 17:33:54,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645312229] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:33:54,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:33:54,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 17] total 51 [2022-03-03 17:33:54,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826483010] [2022-03-03 17:33:54,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:33:54,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-03 17:33:54,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:33:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-03 17:33:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2267, Unknown=0, NotChecked=0, Total=2550 [2022-03-03 17:33:54,555 INFO L87 Difference]: Start difference. First operand 16034 states and 58755 transitions. Second operand has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:34:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:34:15,586 INFO L93 Difference]: Finished difference Result 75679 states and 278632 transitions. [2022-03-03 17:34:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 379 states. [2022-03-03 17:34:15,586 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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 124 [2022-03-03 17:34:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:34:15,989 INFO L225 Difference]: With dead ends: 75679 [2022-03-03 17:34:15,989 INFO L226 Difference]: Without dead ends: 75079 [2022-03-03 17:34:15,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 272 SyntacticMatches, 66 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82726 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=13216, Invalid=154474, Unknown=0, NotChecked=0, Total=167690 [2022-03-03 17:34:15,994 INFO L933 BasicCegarLoop]: 600 mSDtfsCounter, 2434 mSDsluCounter, 18035 mSDsCounter, 0 mSdLazyCounter, 10207 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 17642 SdHoareTripleChecker+Invalid, 21699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 10207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11278 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:34:15,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2434 Valid, 17642 Invalid, 21699 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 10207 Invalid, 0 Unknown, 11278 Unchecked, 4.4s Time] [2022-03-03 17:34:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75079 states. [2022-03-03 17:34:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75079 to 16282. [2022-03-03 17:34:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16282 states, 16281 states have (on average 3.6735458509919536) internal successors, (59809), 16281 states have internal predecessors, (59809), 0 states have call successors, (0), 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-03 17:34:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16282 states to 16282 states and 59809 transitions. [2022-03-03 17:34:16,843 INFO L78 Accepts]: Start accepts. Automaton has 16282 states and 59809 transitions. Word has length 124 [2022-03-03 17:34:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:34:16,843 INFO L470 AbstractCegarLoop]: Abstraction has 16282 states and 59809 transitions. [2022-03-03 17:34:16,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 6.019607843137255) internal successors, (307), 51 states have internal predecessors, (307), 0 states have call successors, (0), 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-03 17:34:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16282 states and 59809 transitions. [2022-03-03 17:34:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:34:16,874 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:34:16,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:34:16,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-03-03 17:34:17,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-03 17:34:17,075 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:34:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:34:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1480667856, now seen corresponding path program 28 times [2022-03-03 17:34:17,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:34:17,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728652479] [2022-03-03 17:34:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:34:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:34:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:34:17,600 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-03 17:34:17,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:34:17,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728652479] [2022-03-03 17:34:17,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728652479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:34:17,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328429262] [2022-03-03 17:34:17,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:34:17,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:34:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:34:17,601 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:34:17,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-03 17:34:17,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:34:17,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:34:17,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:34:17,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:34:18,451 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-03 17:34:18,968 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-03 17:34:19,133 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-03 17:34:19,235 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-03 17:34:19,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:19,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:34:19,766 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-03 17:34:19,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:34:20,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:34:20,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:34:20,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ (select .cse0 c_~A~0.offset) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:34:20,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) c_~A~0.base))) (= (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (+ c_~res1~0 (select .cse0 c_~A~0.offset)))))) is different from false [2022-03-03 17:34:20,395 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~res1~0))))) is different from false [2022-03-03 17:34:20,419 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) is different from false [2022-03-03 17:34:20,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1596) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~res2~0))))) is different from false [2022-03-03 17:34:20,680 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:20,680 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 61 treesize of output 50 [2022-03-03 17:34:20,687 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:20,687 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 398 treesize of output 386 [2022-03-03 17:34:20,696 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:20,696 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 374 treesize of output 322 [2022-03-03 17:34:20,705 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:20,705 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 310 treesize of output 290 [2022-03-03 17:34:20,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:20,715 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 146 treesize of output 143 [2022-03-03 17:34:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:34:22,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328429262] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:34:22,341 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:34:22,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 77 [2022-03-03 17:34:22,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769832310] [2022-03-03 17:34:22,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:34:22,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-03-03 17:34:22,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:34:22,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-03-03 17:34:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=4328, Unknown=10, NotChecked=994, Total=5852 [2022-03-03 17:34:22,343 INFO L87 Difference]: Start difference. First operand 16282 states and 59809 transitions. Second operand has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:34:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:34:28,619 INFO L93 Difference]: Finished difference Result 35396 states and 128960 transitions. [2022-03-03 17:34:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-03 17:34:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 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 124 [2022-03-03 17:34:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:34:28,727 INFO L225 Difference]: With dead ends: 35396 [2022-03-03 17:34:28,727 INFO L226 Difference]: Without dead ends: 35102 [2022-03-03 17:34:28,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 207 SyntacticMatches, 11 SemanticMatches, 129 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 5541 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1573, Invalid=13697, Unknown=10, NotChecked=1750, Total=17030 [2022-03-03 17:34:28,728 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 2186 mSDsluCounter, 7966 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 7640 SdHoareTripleChecker+Invalid, 6254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3817 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:34:28,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2186 Valid, 7640 Invalid, 6254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2371 Invalid, 0 Unknown, 3817 Unchecked, 1.0s Time] [2022-03-03 17:34:28,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35102 states. [2022-03-03 17:34:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35102 to 16562. [2022-03-03 17:34:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16562 states, 16561 states have (on average 3.6774953203308978) internal successors, (60903), 16561 states have internal predecessors, (60903), 0 states have call successors, (0), 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-03 17:34:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16562 states to 16562 states and 60903 transitions. [2022-03-03 17:34:29,204 INFO L78 Accepts]: Start accepts. Automaton has 16562 states and 60903 transitions. Word has length 124 [2022-03-03 17:34:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:34:29,204 INFO L470 AbstractCegarLoop]: Abstraction has 16562 states and 60903 transitions. [2022-03-03 17:34:29,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.961038961038961) internal successors, (305), 77 states have internal predecessors, (305), 0 states have call successors, (0), 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-03 17:34:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 16562 states and 60903 transitions. [2022-03-03 17:34:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:34:29,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:34:29,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:34:29,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-03 17:34:29,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-03 17:34:29,437 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:34:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:34:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 862866234, now seen corresponding path program 29 times [2022-03-03 17:34:29,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:34:29,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974579503] [2022-03-03 17:34:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:34:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:34:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:34:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-03 17:34:30,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:34:30,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974579503] [2022-03-03 17:34:30,164 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974579503] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:34:30,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502817472] [2022-03-03 17:34:30,165 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-03 17:34:30,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:34:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:34:30,168 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:34:30,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-03 17:34:30,286 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-03 17:34:30,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:34:30,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-03 17:34:30,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:34:31,220 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:31,221 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 25 treesize of output 25 [2022-03-03 17:34:31,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-03 17:34:31,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:34:31,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:31,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:34:32,569 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-03 17:34:32,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502817472] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:34:32,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:34:32,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 22] total 63 [2022-03-03 17:34:32,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328676148] [2022-03-03 17:34:32,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:34:32,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-03 17:34:32,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:34:32,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-03 17:34:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=3543, Unknown=0, NotChecked=0, Total=3906 [2022-03-03 17:34:32,570 INFO L87 Difference]: Start difference. First operand 16562 states and 60903 transitions. Second operand has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:34:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:34:42,354 INFO L93 Difference]: Finished difference Result 44412 states and 162289 transitions. [2022-03-03 17:34:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-03 17:34:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 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 124 [2022-03-03 17:34:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:34:42,499 INFO L225 Difference]: With dead ends: 44412 [2022-03-03 17:34:42,499 INFO L226 Difference]: Without dead ends: 43962 [2022-03-03 17:34:42,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 219 SyntacticMatches, 11 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10784 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3448, Invalid=29132, Unknown=0, NotChecked=0, Total=32580 [2022-03-03 17:34:42,501 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 3472 mSDsluCounter, 11061 mSDsCounter, 0 mSdLazyCounter, 5386 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3472 SdHoareTripleChecker+Valid, 10596 SdHoareTripleChecker+Invalid, 8385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 5386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2802 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-03 17:34:42,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3472 Valid, 10596 Invalid, 8385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 5386 Invalid, 0 Unknown, 2802 Unchecked, 2.4s Time] [2022-03-03 17:34:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43962 states. [2022-03-03 17:34:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43962 to 17138. [2022-03-03 17:34:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17138 states, 17137 states have (on average 3.6869347026900856) internal successors, (63183), 17137 states have internal predecessors, (63183), 0 states have call successors, (0), 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-03 17:34:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17138 states to 17138 states and 63183 transitions. [2022-03-03 17:34:43,054 INFO L78 Accepts]: Start accepts. Automaton has 17138 states and 63183 transitions. Word has length 124 [2022-03-03 17:34:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:34:43,054 INFO L470 AbstractCegarLoop]: Abstraction has 17138 states and 63183 transitions. [2022-03-03 17:34:43,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 4.666666666666667) internal successors, (294), 63 states have internal predecessors, (294), 0 states have call successors, (0), 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-03 17:34:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 17138 states and 63183 transitions. [2022-03-03 17:34:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:34:43,088 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:34:43,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:34:43,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-03 17:34:43,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-03 17:34:43,289 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:34:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:34:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1322821530, now seen corresponding path program 30 times [2022-03-03 17:34:43,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:34:43,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469319072] [2022-03-03 17:34:43,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:34:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:34:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:34:43,700 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-03 17:34:43,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:34:43,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469319072] [2022-03-03 17:34:43,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469319072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:34:43,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845732863] [2022-03-03 17:34:43,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-03 17:34:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:34:43,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:34:43,702 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:34:43,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-03 17:34:43,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-03 17:34:43,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:34:43,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 72 conjunts are in the unsatisfiable core [2022-03-03 17:34:43,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:34:44,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:34:44,517 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-03 17:34:44,684 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-03 17:34:44,768 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-03 17:34:44,961 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:34:44,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:34:45,360 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-03 17:34:45,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:34:45,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:34:45,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int) (v_ArrVal_1664 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:34:45,891 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (~M~0 Int) (v_ArrVal_1664 (Array Int Int))) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1665) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))))) is different from false [2022-03-03 17:34:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-03 17:34:46,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845732863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:34:46,009 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:34:46,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 19] total 60 [2022-03-03 17:34:46,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976419798] [2022-03-03 17:34:46,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:34:46,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-03 17:34:46,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:34:46,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-03 17:34:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2802, Unknown=3, NotChecked=336, Total=3540 [2022-03-03 17:34:46,010 INFO L87 Difference]: Start difference. First operand 17138 states and 63183 transitions. Second operand has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:34:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:34:59,806 INFO L93 Difference]: Finished difference Result 62743 states and 230090 transitions. [2022-03-03 17:34:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-03-03 17:34:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 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 124 [2022-03-03 17:34:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:35:00,011 INFO L225 Difference]: With dead ends: 62743 [2022-03-03 17:35:00,012 INFO L226 Difference]: Without dead ends: 62294 [2022-03-03 17:35:00,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 215 SyntacticMatches, 7 SemanticMatches, 249 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 24749 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=5759, Invalid=55506, Unknown=3, NotChecked=1482, Total=62750 [2022-03-03 17:35:00,015 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 2883 mSDsluCounter, 12395 mSDsCounter, 0 mSdLazyCounter, 7949 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 11801 SdHoareTripleChecker+Invalid, 14538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 7949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6333 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-03 17:35:00,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2883 Valid, 11801 Invalid, 14538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 7949 Invalid, 0 Unknown, 6333 Unchecked, 3.6s Time] [2022-03-03 17:35:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62294 states. [2022-03-03 17:35:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62294 to 17170. [2022-03-03 17:35:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17170 states, 17169 states have (on average 3.6889160696604346) internal successors, (63335), 17169 states have internal predecessors, (63335), 0 states have call successors, (0), 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-03 17:35:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17170 states to 17170 states and 63335 transitions. [2022-03-03 17:35:00,858 INFO L78 Accepts]: Start accepts. Automaton has 17170 states and 63335 transitions. Word has length 124 [2022-03-03 17:35:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:35:00,858 INFO L470 AbstractCegarLoop]: Abstraction has 17170 states and 63335 transitions. [2022-03-03 17:35:00,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 5.283333333333333) internal successors, (317), 60 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:35:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 17170 states and 63335 transitions. [2022-03-03 17:35:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:35:00,892 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:35:00,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:35:00,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-03-03 17:35:01,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:01,093 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:35:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:35:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1557467218, now seen corresponding path program 31 times [2022-03-03 17:35:01,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:35:01,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429272375] [2022-03-03 17:35:01,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:35:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:35:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:01,615 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-03 17:35:01,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:35:01,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429272375] [2022-03-03 17:35:01,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429272375] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:35:01,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484357078] [2022-03-03 17:35:01,616 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-03 17:35:01,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:01,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:35:01,617 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:35:01,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-03 17:35:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:01,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 65 conjunts are in the unsatisfiable core [2022-03-03 17:35:01,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:35:02,499 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:02,500 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 25 treesize of output 25 [2022-03-03 17:35:02,816 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-03 17:35:02,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:35:03,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:03,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-03-03 17:35:03,776 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-03 17:35:03,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484357078] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:35:03,777 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:35:03,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 22] total 54 [2022-03-03 17:35:03,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776685684] [2022-03-03 17:35:03,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:35:03,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-03 17:35:03,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:35:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-03 17:35:03,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2514, Unknown=0, NotChecked=0, Total=2862 [2022-03-03 17:35:03,778 INFO L87 Difference]: Start difference. First operand 17170 states and 63335 transitions. Second operand has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 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-03 17:35:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:35:06,822 INFO L93 Difference]: Finished difference Result 32929 states and 121572 transitions. [2022-03-03 17:35:06,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-03 17:35:06,822 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 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) Word has length 124 [2022-03-03 17:35:06,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:35:06,922 INFO L225 Difference]: With dead ends: 32929 [2022-03-03 17:35:06,923 INFO L226 Difference]: Without dead ends: 32779 [2022-03-03 17:35:06,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 218 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3153 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1303, Invalid=8597, Unknown=0, NotChecked=0, Total=9900 [2022-03-03 17:35:06,924 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 1667 mSDsluCounter, 6907 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 6629 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1204 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:35:06,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1667 Valid, 6629 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2295 Invalid, 0 Unknown, 1204 Unchecked, 0.9s Time] [2022-03-03 17:35:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2022-03-03 17:35:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 17234. [2022-03-03 17:35:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17234 states, 17233 states have (on average 3.6863575697789126) internal successors, (63527), 17233 states have internal predecessors, (63527), 0 states have call successors, (0), 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-03 17:35:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17234 states to 17234 states and 63527 transitions. [2022-03-03 17:35:07,416 INFO L78 Accepts]: Start accepts. Automaton has 17234 states and 63527 transitions. Word has length 124 [2022-03-03 17:35:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:35:07,416 INFO L470 AbstractCegarLoop]: Abstraction has 17234 states and 63527 transitions. [2022-03-03 17:35:07,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 4.537037037037037) internal successors, (245), 54 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-03 17:35:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17234 states and 63527 transitions. [2022-03-03 17:35:07,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:35:07,450 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:35:07,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:35:07,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-03 17:35:07,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:07,651 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:35:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:35:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 2104628492, now seen corresponding path program 32 times [2022-03-03 17:35:07,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:35:07,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040405864] [2022-03-03 17:35:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:35:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:35:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:08,299 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-03 17:35:08,300 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:35:08,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040405864] [2022-03-03 17:35:08,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040405864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:35:08,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966335695] [2022-03-03 17:35:08,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-03 17:35:08,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:08,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:35:08,302 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:35:08,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-03 17:35:08,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-03 17:35:08,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:35:08,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:35:08,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:35:08,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:08,518 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:35:08,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:35:08,751 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:35:08,751 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 16 treesize of output 18 [2022-03-03 17:35:08,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:35:09,121 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-03 17:35:09,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:09,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:09,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:09,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:35:09,859 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-03 17:35:09,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:35:10,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:10,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (~M~0 Int)) (or (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:10,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (~M~0 Int)) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1735) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1736) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~res1~0))))) is different from false [2022-03-03 17:35:10,700 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 10 treesize of output 8 [2022-03-03 17:35:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-03 17:35:10,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966335695] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:35:10,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:35:10,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 20] total 61 [2022-03-03 17:35:10,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148054706] [2022-03-03 17:35:10,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:35:10,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-03 17:35:10,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:35:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-03 17:35:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2839, Unknown=3, NotChecked=342, Total=3660 [2022-03-03 17:35:10,721 INFO L87 Difference]: Start difference. First operand 17234 states and 63527 transitions. Second operand has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:35:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:35:21,556 INFO L93 Difference]: Finished difference Result 53099 states and 194485 transitions. [2022-03-03 17:35:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-03-03 17:35:21,557 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 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 124 [2022-03-03 17:35:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:35:21,744 INFO L225 Difference]: With dead ends: 53099 [2022-03-03 17:35:21,744 INFO L226 Difference]: Without dead ends: 52799 [2022-03-03 17:35:21,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 204 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16176 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=5479, Invalid=35536, Unknown=3, NotChecked=1212, Total=42230 [2022-03-03 17:35:21,748 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 2561 mSDsluCounter, 8730 mSDsCounter, 0 mSdLazyCounter, 4867 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 8475 SdHoareTripleChecker+Invalid, 11864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 4867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6777 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-03 17:35:21,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2561 Valid, 8475 Invalid, 11864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 4867 Invalid, 0 Unknown, 6777 Unchecked, 2.3s Time] [2022-03-03 17:35:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52799 states. [2022-03-03 17:35:22,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52799 to 17321. [2022-03-03 17:35:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17321 states, 17320 states have (on average 3.6916281755196305) internal successors, (63939), 17320 states have internal predecessors, (63939), 0 states have call successors, (0), 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-03 17:35:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17321 states to 17321 states and 63939 transitions. [2022-03-03 17:35:22,470 INFO L78 Accepts]: Start accepts. Automaton has 17321 states and 63939 transitions. Word has length 124 [2022-03-03 17:35:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:35:22,470 INFO L470 AbstractCegarLoop]: Abstraction has 17321 states and 63939 transitions. [2022-03-03 17:35:22,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 5.19672131147541) internal successors, (317), 61 states have internal predecessors, (317), 0 states have call successors, (0), 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-03 17:35:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17321 states and 63939 transitions. [2022-03-03 17:35:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:35:22,502 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:35:22,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:35:22,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-03 17:35:22,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:22,703 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:35:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:35:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash -775660256, now seen corresponding path program 33 times [2022-03-03 17:35:22,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:35:22,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71712504] [2022-03-03 17:35:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:35:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:35:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:23,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-03 17:35:23,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:35:23,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71712504] [2022-03-03 17:35:23,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71712504] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:35:23,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456874042] [2022-03-03 17:35:23,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-03 17:35:23,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:35:23,192 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:35:23,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-03 17:35:23,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-03 17:35:23,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:35:23,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:35:23,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:35:23,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:23,418 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-03-03 17:35:23,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-03-03 17:35:23,659 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-03-03 17:35:23,660 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 16 treesize of output 18 [2022-03-03 17:35:23,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-03 17:35:24,044 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-03 17:35:24,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:24,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-03-03 17:35:24,479 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:24,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:35:24,824 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-03 17:35:24,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:35:25,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-03 17:35:25,311 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int) (v_ArrVal_1774 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-03 17:35:25,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1775 (Array Int Int)) (~M~0 Int) (v_ArrVal_1774 (Array Int Int))) (or (<= (+ ~M~0 1) |c_thread1Thread1of1ForFork0_~i~0#1|) (< 0 ~M~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1774) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1775) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))))))) is different from false [2022-03-03 17:35:25,637 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 10 treesize of output 8 [2022-03-03 17:35:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-03 17:35:25,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456874042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:35:25,657 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:35:25,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 20] total 65 [2022-03-03 17:35:25,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034528281] [2022-03-03 17:35:25,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:35:25,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-03 17:35:25,658 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:35:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-03 17:35:25,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=3314, Unknown=3, NotChecked=366, Total=4160 [2022-03-03 17:35:25,659 INFO L87 Difference]: Start difference. First operand 17321 states and 63939 transitions. Second operand has 65 states, 65 states have (on average 4.8307692307692305) internal successors, (314), 65 states have internal predecessors, (314), 0 states have call successors, (0), 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-03 17:35:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-03 17:35:44,369 INFO L93 Difference]: Finished difference Result 64330 states and 235649 transitions. [2022-03-03 17:35:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2022-03-03 17:35:44,369 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 4.8307692307692305) internal successors, (314), 65 states have internal predecessors, (314), 0 states have call successors, (0), 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 124 [2022-03-03 17:35:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-03 17:35:44,571 INFO L225 Difference]: With dead ends: 64330 [2022-03-03 17:35:44,571 INFO L226 Difference]: Without dead ends: 63886 [2022-03-03 17:35:44,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 240 SyntacticMatches, 26 SemanticMatches, 307 ConstructedPredicates, 3 IntricatePredicates, 7 DeprecatedPredicates, 43134 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=11869, Invalid=81470, Unknown=3, NotChecked=1830, Total=95172 [2022-03-03 17:35:44,577 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 3864 mSDsluCounter, 13723 mSDsCounter, 0 mSdLazyCounter, 6420 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3864 SdHoareTripleChecker+Valid, 12884 SdHoareTripleChecker+Invalid, 14598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 6420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7950 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-03-03 17:35:44,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3864 Valid, 12884 Invalid, 14598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 6420 Invalid, 0 Unknown, 7950 Unchecked, 2.9s Time] [2022-03-03 17:35:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63886 states. [2022-03-03 17:35:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63886 to 17920. [2022-03-03 17:35:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17920 states, 17919 states have (on average 3.7065684468999387) internal successors, (66418), 17919 states have internal predecessors, (66418), 0 states have call successors, (0), 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-03 17:35:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17920 states to 17920 states and 66418 transitions. [2022-03-03 17:35:45,399 INFO L78 Accepts]: Start accepts. Automaton has 17920 states and 66418 transitions. Word has length 124 [2022-03-03 17:35:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-03 17:35:45,399 INFO L470 AbstractCegarLoop]: Abstraction has 17920 states and 66418 transitions. [2022-03-03 17:35:45,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 4.8307692307692305) internal successors, (314), 65 states have internal predecessors, (314), 0 states have call successors, (0), 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-03 17:35:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 17920 states and 66418 transitions. [2022-03-03 17:35:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-03-03 17:35:45,431 INFO L506 BasicCegarLoop]: Found error trace [2022-03-03 17:35:45,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-03 17:35:45,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-03 17:35:45,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-03-03 17:35:45,632 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-03 17:35:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-03 17:35:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1210786928, now seen corresponding path program 34 times [2022-03-03 17:35:45,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-03 17:35:45,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120634289] [2022-03-03 17:35:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-03 17:35:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-03 17:35:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-03 17:35:46,358 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-03 17:35:46,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-03 17:35:46,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120634289] [2022-03-03 17:35:46,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120634289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-03 17:35:46,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080946549] [2022-03-03 17:35:46,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-03 17:35:46,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-03 17:35:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-03 17:35:46,360 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-03 17:35:46,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-03 17:35:46,487 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-03 17:35:46,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-03 17:35:46,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-03-03 17:35:46,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-03 17:35:47,113 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-03 17:35:47,580 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-03 17:35:47,753 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-03 17:35:47,857 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-03 17:35:48,043 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:48,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-03-03 17:35:48,386 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-03 17:35:48,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-03 17:35:48,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:48,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:48,958 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) c_~A~0.base))) (= (+ c_~res1~0 (select .cse0 c_~A~0.offset)) (+ c_~res2~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:48,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset (* ~M~0 4))) c_~res2~0) (+ (select .cse0 c_~A~0.offset) c_~res1~0))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:49,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (= (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~res2~0) (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:49,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (+ (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0) (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:49,131 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1812 (Array Int Int)) (v_ArrVal_1811 (Array Int Int)) (v_ArrVal_1810 (Array Int Int)) (~M~0 Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1811) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1812) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0) (+ c_~res2~0 (select .cse0 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-03-03 17:35:49,383 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:49,383 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 61 treesize of output 50 [2022-03-03 17:35:49,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:49,391 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 806 treesize of output 770 [2022-03-03 17:35:49,400 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:49,401 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 758 treesize of output 706 [2022-03-03 17:35:49,424 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:49,425 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 694 treesize of output 674 [2022-03-03 17:35:49,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-03 17:35:49,436 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 662 treesize of output 546 [2022-03-03 17:35:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-03 17:35:52,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080946549] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-03 17:35:52,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-03 17:35:52,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 33, 29] total 78 [2022-03-03 17:35:52,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977717758] [2022-03-03 17:35:52,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-03 17:35:52,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-03-03 17:35:52,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-03 17:35:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-03-03 17:35:52,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=4523, Unknown=9, NotChecked=1008, Total=6006 [2022-03-03 17:35:52,986 INFO L87 Difference]: Start difference. First operand 17920 states and 66418 transitions. Second operand has 78 states, 78 states have (on average 4.0256410256410255) internal successors, (314), 78 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-03 17:36:11,851 WARN L244 SmtUtils]: Removed 13 from assertion stack [2022-03-03 17:36:11,852 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-03 17:36:11,852 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-03 17:36:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-03-03 17:36:11,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 203 SyntacticMatches, 7 SemanticMatches, 135 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5205 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=1943, Invalid=14846, Unknown=9, NotChecked=1834, Total=18632 [2022-03-03 17:36:11,853 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 1120 mSDsluCounter, 6632 mSDsCounter, 0 mSdLazyCounter, 4560 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 6613 SdHoareTripleChecker+Invalid, 7684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3032 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-03 17:36:11,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1120 Valid, 6613 Invalid, 7684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4560 Invalid, 0 Unknown, 3032 Unchecked, 2.0s Time] [2022-03-03 17:36:11,854 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-03-03 17:36:11,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-03 17:36:12,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-03-03 17:36:12,055 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (17920states) and FLOYD_HOARE automaton (currently 75 states, 78 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 69 for 22ms.. [2022-03-03 17:36:12,057 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-03 17:36:12,057 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-03 17:36:12,057 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-03 17:36:12,059 INFO L732 BasicCegarLoop]: Path program histogram: [34, 9, 6, 1, 1, 1, 1, 1, 1] [2022-03-03 17:36:12,060 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-03 17:36:12,060 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-03 17:36:12,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:36:12 BasicIcfg [2022-03-03 17:36:12,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-03 17:36:12,061 INFO L158 Benchmark]: Toolchain (without parser) took 743933.84ms. Allocated memory was 189.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 138.4MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 642.5MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.87ms. Allocated memory is still 189.8MB. Free memory was 138.1MB in the beginning and 164.4MB in the end (delta: -26.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.03ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 161.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: Boogie Preprocessor took 19.16ms. Allocated memory is still 189.8MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: RCFGBuilder took 500.63ms. Allocated memory is still 189.8MB. Free memory was 160.2MB in the beginning and 131.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,061 INFO L158 Benchmark]: TraceAbstraction took 743173.35ms. Allocated memory was 189.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 131.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 635.9MB. Max. memory is 8.0GB. [2022-03-03 17:36:12,062 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.87ms. Allocated memory is still 189.8MB. Free memory was 138.1MB in the beginning and 164.4MB in the end (delta: -26.3MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.03ms. Allocated memory is still 189.8MB. Free memory was 164.4MB in the beginning and 161.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.16ms. Allocated memory is still 189.8MB. Free memory was 161.8MB in the beginning and 160.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 500.63ms. Allocated memory is still 189.8MB. Free memory was 160.2MB in the beginning and 131.9MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 743173.35ms. Allocated memory was 189.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 131.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 635.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (17920states) and FLOYD_HOARE automaton (currently 75 states, 78 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 69 for 22ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17920states) and FLOYD_HOARE automaton (currently 75 states, 78 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 69 for 22ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17920states) and FLOYD_HOARE automaton (currently 75 states, 78 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 69 for 22ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (17920states) and FLOYD_HOARE automaton (currently 75 states, 78 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 69 for 22ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 178 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 743.0s, OverallIterations: 55, TraceHistogramMax: 1, PathProgramHistogramMax: 34, EmptinessCheckTime: 1.4s, AutomataDifference: 512.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112280 SdHoareTripleChecker+Valid, 97.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112280 mSDsluCounter, 418841 SdHoareTripleChecker+Invalid, 81.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 216598 IncrementalHoareTripleChecker+Unchecked, 435971 mSDsCounter, 6466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223594 IncrementalHoareTripleChecker+Invalid, 446658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6466 mSolverCounterUnsat, 17550 mSDtfsCounter, 223594 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20625 GetRequests, 11024 SyntacticMatches, 478 SemanticMatches, 9122 ConstructedPredicates, 156 IntricatePredicates, 38 DeprecatedPredicates, 1188734 ImplicationChecksByTransitivity, 422.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17920occurred in iteration=54, InterpolantAutomatonStates: 7055, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.8s AutomataMinimizationTime, 54 MinimizatonAttempts, 1503716 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 182.2s InterpolantComputationTime, 12859 NumberOfCodeBlocks, 12849 NumberOfCodeBlocksAsserted, 153 NumberOfCheckSat, 18862 ConstructedInterpolants, 1853 QuantifiedInterpolants, 231264 SizeOfPredicates, 1780 NumberOfNonLiveVariables, 16052 ConjunctsInSsa, 3015 ConjunctsInUnsatCore, 155 InterpolantComputations, 8 PerfectInterpolantSequences, 79/432 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