./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i --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/reducercommutativity/sep.i -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 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 21:58:48,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 21:58:48,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 21:58:48,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 21:58:48,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 21:58:48,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 21:58:48,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 21:58:48,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 21:58:48,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 21:58:48,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 21:58:48,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 21:58:48,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 21:58:48,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 21:58:48,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 21:58:48,569 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 21:58:48,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 21:58:48,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 21:58:48,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 21:58:48,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 21:58:48,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 21:58:48,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 21:58:48,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 21:58:48,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 21:58:48,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 21:58:48,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 21:58:48,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 21:58:48,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 21:58:48,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 21:58:48,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 21:58:48,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 21:58:48,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 21:58:48,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 21:58:48,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:48,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 21:58:48,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 21:58:48,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 21:58:48,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 21:58:48,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 21:58:48,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 21:58:48,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 21:58:48,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 21:58:48,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 21:58:48,589 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 -> 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac [2024-10-10 21:58:48,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 21:58:48,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 21:58:48,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 21:58:48,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 21:58:48,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 21:58:48,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2024-10-10 21:58:50,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 21:58:50,565 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 21:58:50,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2024-10-10 21:58:50,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eccb14f8d/a49c3b4774294c09ac7b8eb4870ff5c6/FLAGd6dde7ec2 [2024-10-10 21:58:50,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/eccb14f8d/a49c3b4774294c09ac7b8eb4870ff5c6 [2024-10-10 21:58:50,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 21:58:50,592 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 21:58:50,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:50,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 21:58:50,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 21:58:50,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4476b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50, skipping insertion in model container [2024-10-10 21:58:50,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 21:58:50,804 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/reducercommutativity/sep.i[1298,1311] [2024-10-10 21:58:50,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:50,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 21:58:50,846 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/reducercommutativity/sep.i[1298,1311] [2024-10-10 21:58:50,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 21:58:50,871 INFO L204 MainTranslator]: Completed translation [2024-10-10 21:58:50,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50 WrapperNode [2024-10-10 21:58:50,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 21:58:50,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:50,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 21:58:50,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 21:58:50,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,910 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2024-10-10 21:58:50,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 21:58:50,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 21:58:50,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 21:58:50,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 21:58:50,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,953 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 6, 9]. 53 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2024-10-10 21:58:50,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 21:58:50,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 21:58:50,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 21:58:50,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 21:58:50,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (1/1) ... [2024-10-10 21:58:50,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 21:58:50,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:51,016 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 21:58:51,019 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 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 21:58:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 21:58:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 21:58:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 21:58:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 21:58:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 21:58:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 21:58:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 21:58:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 21:58:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 21:58:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2024-10-10 21:58:51,058 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2024-10-10 21:58:51,129 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 21:58:51,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 21:58:51,278 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-10 21:58:51,279 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 21:58:51,305 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 21:58:51,305 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 21:58:51,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:51 BoogieIcfgContainer [2024-10-10 21:58:51,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 21:58:51,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 21:58:51,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 21:58:51,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 21:58:51,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 09:58:50" (1/3) ... [2024-10-10 21:58:51,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb99fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:51, skipping insertion in model container [2024-10-10 21:58:51,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 09:58:50" (2/3) ... [2024-10-10 21:58:51,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb99fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 09:58:51, skipping insertion in model container [2024-10-10 21:58:51,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 09:58:51" (3/3) ... [2024-10-10 21:58:51,315 INFO L112 eAbstractionObserver]: Analyzing ICFG sep.i [2024-10-10 21:58:51,331 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 21:58:51,332 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 21:58:51,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 21:58:51,397 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;@73d24e43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 21:58:51,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 21:58:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 21:58:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 21:58:51,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:51,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:51,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:51,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:51,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1654425845, now seen corresponding path program 1 times [2024-10-10 21:58:51,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:51,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491515332] [2024-10-10 21:58:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:51,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:58:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:58:51,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491515332] [2024-10-10 21:58:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491515332] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517307696] [2024-10-10 21:58:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:51,911 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 21:58:51,912 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 21:58:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-10 21:58:52,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 21:58:52,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517307696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:52,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2024-10-10 21:58:52,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304580921] [2024-10-10 21:58:52,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:52,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 21:58:52,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 21:58:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:52,099 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:52,157 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2024-10-10 21:58:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 21:58:52,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-10 21:58:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:52,169 INFO L225 Difference]: With dead ends: 41 [2024-10-10 21:58:52,169 INFO L226 Difference]: Without dead ends: 19 [2024-10-10 21:58:52,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 21:58:52,175 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:52,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-10 21:58:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-10 21:58:52,208 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 21:58:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-10-10 21:58:52,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 24 [2024-10-10 21:58:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:52,212 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-10-10 21:58:52,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-10-10 21:58:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 21:58:52,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:52,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:52,237 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 21:58:52,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-10 21:58:52,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -475344815, now seen corresponding path program 1 times [2024-10-10 21:58:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:52,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101191452] [2024-10-10 21:58:52,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-10 21:58:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-10 21:58:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:58:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101191452] [2024-10-10 21:58:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101191452] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:52,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527505608] [2024-10-10 21:58:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:52,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:52,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:52,579 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 21:58:52,580 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 21:58:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:52,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 21:58:52,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 21:58:52,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 21:58:52,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527505608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:52,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 21:58:52,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-10 21:58:52,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757580600] [2024-10-10 21:58:52,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:52,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:58:52,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:52,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:58:52,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 21:58:52,725 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:52,773 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-10 21:58:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:58:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-10 21:58:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:52,775 INFO L225 Difference]: With dead ends: 38 [2024-10-10 21:58:52,775 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 21:58:52,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 21:58:52,778 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:52,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 21:58:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-10-10 21:58:52,785 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 21:58:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-10 21:58:52,786 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2024-10-10 21:58:52,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:52,786 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-10 21:58:52,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-10 21:58:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-10 21:58:52,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:52,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:52,808 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 21:58:52,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:52,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:52,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:52,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2026227477, now seen corresponding path program 1 times [2024-10-10 21:58:52,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945362345] [2024-10-10 21:58:52,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 21:58:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 21:58:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945362345] [2024-10-10 21:58:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945362345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 21:58:53,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 21:58:53,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 21:58:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114839235] [2024-10-10 21:58:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 21:58:53,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 21:58:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 21:58:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 21:58:53,135 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:53,174 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-10 21:58:53,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 21:58:53,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-10-10 21:58:53,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:53,176 INFO L225 Difference]: With dead ends: 34 [2024-10-10 21:58:53,176 INFO L226 Difference]: Without dead ends: 21 [2024-10-10 21:58:53,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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 21:58:53,177 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:53,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 21:58:53,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-10 21:58:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-10 21:58:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 21:58:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-10 21:58:53,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 33 [2024-10-10 21:58:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:53,183 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-10 21:58:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 21:58:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-10 21:58:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 21:58:53,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:53,184 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:53,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 21:58:53,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:53,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:53,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1147416046, now seen corresponding path program 1 times [2024-10-10 21:58:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237657086] [2024-10-10 21:58:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 21:58:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 21:58:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:58:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237657086] [2024-10-10 21:58:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237657086] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:53,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258322993] [2024-10-10 21:58:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:53,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:53,358 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 21:58:53,360 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 21:58:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:53,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 21:58:53,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 21:58:53,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 21:58:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258322993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:53,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-10-10 21:58:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049567667] [2024-10-10 21:58:53,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:53,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 21:58:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 21:58:53,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-10 21:58:53,685 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:58:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:53,761 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2024-10-10 21:58:53,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 21:58:53,762 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2024-10-10 21:58:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:53,763 INFO L225 Difference]: With dead ends: 44 [2024-10-10 21:58:53,763 INFO L226 Difference]: Without dead ends: 26 [2024-10-10 21:58:53,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-10 21:58:53,765 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:53,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:53,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-10 21:58:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-10 21:58:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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 21:58:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-10 21:58:53,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 34 [2024-10-10 21:58:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-10 21:58:53,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-10 21:58:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-10 21:58:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:58:53,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:53,772 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:53,790 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 21:58:53,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:53,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:53,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:53,974 INFO L85 PathProgramCache]: Analyzing trace with hash -350190832, now seen corresponding path program 2 times [2024-10-10 21:58:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825789891] [2024-10-10 21:58:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 21:58:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825789891] [2024-10-10 21:58:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825789891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509218233] [2024-10-10 21:58:55,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 21:58:55,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:55,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:55,223 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 21:58:55,224 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 [2024-10-10 21:58:55,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 21:58:55,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 21:58:55,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-10 21:58:55,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 21:58:55,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:58:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 21:58:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509218233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:58:55,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:58:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2024-10-10 21:58:55,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211903837] [2024-10-10 21:58:55,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:58:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 21:58:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:58:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 21:58:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-10 21:58:55,736 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 17 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 21:58:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 21:58:55,901 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-10-10 21:58:55,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-10 21:58:55,901 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-10-10 21:58:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 21:58:55,906 INFO L225 Difference]: With dead ends: 59 [2024-10-10 21:58:55,906 INFO L226 Difference]: Without dead ends: 55 [2024-10-10 21:58:55,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-10-10 21:58:55,908 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 21:58:55,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 21:58:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-10 21:58:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2024-10-10 21:58:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-10 21:58:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2024-10-10 21:58:55,928 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 43 [2024-10-10 21:58:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 21:58:55,928 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2024-10-10 21:58:55,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.0) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 21:58:55,930 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2024-10-10 21:58:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 21:58:55,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 21:58:55,932 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 21:58:55,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 21:58:56,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:56,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 21:58:56,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 21:58:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1159537458, now seen corresponding path program 1 times [2024-10-10 21:58:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 21:58:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803778558] [2024-10-10 21:58:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 21:58:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-10 21:58:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-10 21:58:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-10 21:58:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 21:58:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 21:58:57,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803778558] [2024-10-10 21:58:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803778558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 21:58:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982177169] [2024-10-10 21:58:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 21:58:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 21:58:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 21:58:57,539 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:58:57,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 21:58:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 21:58:57,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-10 21:58:57,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 21:58:57,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-10 21:58:58,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-10 21:59:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 21:59:06,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 21:59:06,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-10-10 21:59:06,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-10 21:59:06,837 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-10-10 21:59:06,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-10-10 21:59:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 21:59:07,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982177169] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 21:59:07,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 21:59:07,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 42 [2024-10-10 21:59:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053798920] [2024-10-10 21:59:07,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 21:59:07,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-10 21:59:07,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 21:59:07,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-10 21:59:07,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1496, Unknown=2, NotChecked=0, Total=1722 [2024-10-10 21:59:07,138 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 42 states, 40 states have (on average 2.225) internal successors, (89), 40 states have internal predecessors, (89), 6 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-10 21:59:12,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:20,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:24,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:36,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 21:59:41,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:00:00,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:00:02,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:00:22,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:00:26,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]