./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:16:38,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:16:38,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:16:38,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:16:39,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:16:39,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:16:39,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:16:39,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:16:39,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:16:39,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:16:39,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:16:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:16:39,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:16:39,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:16:39,027 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:16:39,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:16:39,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:16:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:16:39,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:16:39,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:16:39,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:16:39,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:16:39,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:16:39,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:16:39,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:16:39,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:16:39,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:16:39,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:16:39,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:16:39,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:16:39,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:16:39,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:16:39,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:16:39,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:16:39,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:16:39,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:16:39,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:16:39,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:16:39,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:16:39,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:16:39,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:16:39,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:16:39,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 [2024-10-10 22:16:39,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:16:39,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:16:39,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:16:39,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:16:39,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:16:39,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2024-10-10 22:16:40,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:16:40,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:16:40,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2024-10-10 22:16:40,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8f64ef3d9/5db70478fb864cdeb3b7a1574d79184a/FLAG47e00b19a [2024-10-10 22:16:40,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8f64ef3d9/5db70478fb864cdeb3b7a1574d79184a [2024-10-10 22:16:40,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:16:40,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:16:40,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:16:40,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:16:40,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:16:40,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd3a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40, skipping insertion in model container [2024-10-10 22:16:40,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:16:40,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2024-10-10 22:16:40,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:16:40,920 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:16:40,932 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2024-10-10 22:16:40,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:16:40,950 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:16:40,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40 WrapperNode [2024-10-10 22:16:40,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:16:40,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:16:40,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:16:40,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:16:40,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,986 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-10-10 22:16:40,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:16:40,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:16:40,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:16:40,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:16:40,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:40,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,012 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-10-10 22:16:41,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:16:41,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:16:41,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:16:41,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:16:41,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (1/1) ... [2024-10-10 22:16:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:16:41,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:16:41,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:16:41,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:16:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:16:41,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-10 22:16:41,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:16:41,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:16:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:16:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:16:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-10 22:16:41,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:16:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:16:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:16:41,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:16:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:16:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-10 22:16:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:16:41,177 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:16:41,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:16:41,343 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-10 22:16:41,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:16:41,373 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:16:41,373 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-10 22:16:41,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:16:41 BoogieIcfgContainer [2024-10-10 22:16:41,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:16:41,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:16:41,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:16:41,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:16:41,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:16:40" (1/3) ... [2024-10-10 22:16:41,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733e8db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:16:41, skipping insertion in model container [2024-10-10 22:16:41,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:16:40" (2/3) ... [2024-10-10 22:16:41,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733e8db9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:16:41, skipping insertion in model container [2024-10-10 22:16:41,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:16:41" (3/3) ... [2024-10-10 22:16:41,379 INFO L112 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2024-10-10 22:16:41,391 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:16:41,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:16:41,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:16:41,441 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@883e21e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:16:41,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:16:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:16:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-10 22:16:41,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:41,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:41,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:41,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1394429076, now seen corresponding path program 1 times [2024-10-10 22:16:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:41,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071890626] [2024-10-10 22:16:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:16:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071890626] [2024-10-10 22:16:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071890626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:16:41,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:16:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:16:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931221708] [2024-10-10 22:16:41,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:16:41,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:16:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:16:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:16:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:16:41,724 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:16:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:16:41,774 INFO L93 Difference]: Finished difference Result 44 states and 73 transitions. [2024-10-10 22:16:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:16:41,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-10 22:16:41,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:16:41,785 INFO L225 Difference]: With dead ends: 44 [2024-10-10 22:16:41,786 INFO L226 Difference]: Without dead ends: 23 [2024-10-10 22:16:41,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:16:41,791 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:16:41,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:16:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-10 22:16:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2024-10-10 22:16:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:16:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-10 22:16:41,821 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 8 [2024-10-10 22:16:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:16:41,821 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-10 22:16:41,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:16:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-10 22:16:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:16:41,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:41,823 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:41,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:16:41,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:41,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:41,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1234834936, now seen corresponding path program 1 times [2024-10-10 22:16:41,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:41,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568742491] [2024-10-10 22:16:41,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:41,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:16:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:16:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:16:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:16:42,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:42,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568742491] [2024-10-10 22:16:42,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568742491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:16:42,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:16:42,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:16:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175806745] [2024-10-10 22:16:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:16:42,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:16:42,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:16:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:16:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:16:42,008 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:16:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:16:42,067 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-10-10 22:16:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:16:42,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-10 22:16:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:16:42,068 INFO L225 Difference]: With dead ends: 30 [2024-10-10 22:16:42,069 INFO L226 Difference]: Without dead ends: 24 [2024-10-10 22:16:42,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:16:42,071 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:16:42,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:16:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-10 22:16:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-10-10 22:16:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-10 22:16:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-10 22:16:42,080 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 25 [2024-10-10 22:16:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:16:42,080 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-10 22:16:42,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:16:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-10 22:16:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:16:42,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:42,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:42,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:16:42,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:42,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 934488912, now seen corresponding path program 1 times [2024-10-10 22:16:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:42,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953421293] [2024-10-10 22:16:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:16:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:16:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:16:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:16:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953421293] [2024-10-10 22:16:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953421293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:16:42,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200058007] [2024-10-10 22:16:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:42,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:42,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:16:42,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:16:42,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:16:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:16:42,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:16:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:16:42,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:16:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:16:42,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200058007] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:16:42,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:16:42,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 22:16:42,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818269371] [2024-10-10 22:16:42,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:16:42,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:16:42,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:16:42,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:16:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:16:42,477 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-10 22:16:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:16:42,604 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2024-10-10 22:16:42,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:16:42,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 26 [2024-10-10 22:16:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:16:42,605 INFO L225 Difference]: With dead ends: 58 [2024-10-10 22:16:42,605 INFO L226 Difference]: Without dead ends: 49 [2024-10-10 22:16:42,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:16:42,606 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 60 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:16:42,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 29 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:16:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-10 22:16:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2024-10-10 22:16:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-10 22:16:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-10-10 22:16:42,617 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 26 [2024-10-10 22:16:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:16:42,617 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-10-10 22:16:42,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-10 22:16:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-10-10 22:16:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-10 22:16:42,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:42,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:42,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:16:42,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:42,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:42,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1525972372, now seen corresponding path program 2 times [2024-10-10 22:16:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789598036] [2024-10-10 22:16:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:16:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:16:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:16:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:16:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-10 22:16:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 22:16:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-10 22:16:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-10 22:16:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-10 22:16:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-10 22:16:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-10 22:16:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-10 22:16:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-10 22:16:43,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:43,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789598036] [2024-10-10 22:16:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789598036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:16:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380447372] [2024-10-10 22:16:43,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:16:43,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:43,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:16:43,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:16:43,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:16:43,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:16:43,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:16:43,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:16:43,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:16:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-10 22:16:43,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:16:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-10 22:16:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380447372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:16:43,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:16:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-10 22:16:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691820287] [2024-10-10 22:16:43,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:16:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-10 22:16:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:16:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-10 22:16:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:16:43,489 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-10-10 22:16:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:16:43,783 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2024-10-10 22:16:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:16:43,784 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 80 [2024-10-10 22:16:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:16:43,787 INFO L225 Difference]: With dead ends: 127 [2024-10-10 22:16:43,787 INFO L226 Difference]: Without dead ends: 115 [2024-10-10 22:16:43,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:16:43,788 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 162 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:16:43,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 59 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:16:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-10 22:16:43,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2024-10-10 22:16:43,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-10 22:16:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 105 transitions. [2024-10-10 22:16:43,812 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 105 transitions. Word has length 80 [2024-10-10 22:16:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:16:43,812 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 105 transitions. [2024-10-10 22:16:43,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 18 states have internal predecessors, (43), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-10-10 22:16:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2024-10-10 22:16:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-10 22:16:43,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:43,820 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:43,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:16:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:44,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:44,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1608222956, now seen corresponding path program 3 times [2024-10-10 22:16:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100547399] [2024-10-10 22:16:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:16:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:16:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:16:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:16:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-10 22:16:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 22:16:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-10 22:16:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-10 22:16:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-10 22:16:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-10 22:16:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-10 22:16:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-10 22:16:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-10 22:16:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-10 22:16:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-10 22:16:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-10 22:16:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-10 22:16:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-10 22:16:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-10 22:16:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-10 22:16:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-10 22:16:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-10 22:16:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-10 22:16:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-10 22:16:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-10 22:16:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-10 22:16:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-10 22:16:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-10 22:16:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-10 22:16:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-10 22:16:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2024-10-10 22:16:44,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100547399] [2024-10-10 22:16:44,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100547399] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:16:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825000817] [2024-10-10 22:16:44,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:16:44,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:44,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:16:44,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:16:44,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:16:44,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-10 22:16:44,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:16:44,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:16:44,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:16:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2024-10-10 22:16:45,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:16:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1975 trivial. 0 not checked. [2024-10-10 22:16:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825000817] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:16:45,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:16:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 37 [2024-10-10 22:16:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250228618] [2024-10-10 22:16:45,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:16:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-10 22:16:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:16:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-10 22:16:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2024-10-10 22:16:45,448 INFO L87 Difference]: Start difference. First operand 74 states and 105 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 states have internal predecessors, (67), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-10-10 22:16:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:16:46,086 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2024-10-10 22:16:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-10 22:16:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 states have internal predecessors, (67), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 188 [2024-10-10 22:16:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:16:46,090 INFO L225 Difference]: With dead ends: 265 [2024-10-10 22:16:46,091 INFO L226 Difference]: Without dead ends: 247 [2024-10-10 22:16:46,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2024-10-10 22:16:46,094 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 438 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:16:46,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 104 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:16:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-10 22:16:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 146. [2024-10-10 22:16:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-10 22:16:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2024-10-10 22:16:46,118 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 188 [2024-10-10 22:16:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:16:46,139 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2024-10-10 22:16:46,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 states have internal predecessors, (67), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-10-10 22:16:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2024-10-10 22:16:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-10 22:16:46,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:16:46,148 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:16:46,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:16:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:46,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:16:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:16:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1358804460, now seen corresponding path program 4 times [2024-10-10 22:16:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:16:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072222354] [2024-10-10 22:16:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:16:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:16:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 22:16:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:16:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-10 22:16:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:16:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-10 22:16:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 22:16:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-10 22:16:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-10 22:16:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-10 22:16:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-10 22:16:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-10 22:16:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-10 22:16:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-10 22:16:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-10 22:16:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-10 22:16:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-10 22:16:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-10 22:16:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-10 22:16:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-10 22:16:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-10 22:16:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-10 22:16:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-10 22:16:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-10 22:16:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-10 22:16:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-10 22:16:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-10 22:16:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-10 22:16:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-10 22:16:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-10 22:16:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-10 22:16:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-10 22:16:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-10 22:16:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-10 22:16:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-10 22:16:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-10 22:16:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-10 22:16:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-10 22:16:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-10 22:16:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-10-10 22:16:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-10 22:16:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-10 22:16:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-10 22:16:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-10 22:16:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-10 22:16:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-10 22:16:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-10 22:16:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-10-10 22:16:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-10-10 22:16:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-10-10 22:16:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-10-10 22:16:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-10 22:16:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-10-10 22:16:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2024-10-10 22:16:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2024-10-10 22:16:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-10 22:16:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2024-10-10 22:16:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-10 22:16:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-10 22:16:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2024-10-10 22:16:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-10 22:16:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2024-10-10 22:16:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-10 22:16:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2024-10-10 22:16:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2024-10-10 22:16:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2024-10-10 22:16:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2024-10-10 22:16:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:16:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10010 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 8833 trivial. 0 not checked. [2024-10-10 22:16:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:16:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072222354] [2024-10-10 22:16:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072222354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:16:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620928266] [2024-10-10 22:16:47,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:16:47,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:16:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:16:47,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:16:47,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process