./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-multidimensional/copy-3-n-u.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-multidimensional/copy-3-n-u.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 caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:10:30,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:10:30,139 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:10:30,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:10:30,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:10:30,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:10:30,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:10:30,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:10:30,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:10:30,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:10:30,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:10:30,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:10:30,183 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:10:30,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:10:30,184 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:10:30,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:10:30,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:10:30,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:10:30,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:10:30,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:10:30,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:10:30,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:10:30,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:10:30,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:10:30,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:10:30,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:10:30,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:10:30,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:10:30,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:10:30,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:10:30,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:10:30,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:10:30,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:10:30,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:10:30,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:10:30,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:10:30,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:10:30,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:10:30,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:10:30,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:10:30,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:10:30,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:10:30,196 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 -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2024-10-10 22:10:30,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:10:30,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:10:30,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:10:30,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:10:30,458 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:10:30,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-10-10 22:10:32,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:10:32,173 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:10:32,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-10-10 22:10:32,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ef58a553/80ec536728ba4ce68c5820246f838f61/FLAG8294fd84c [2024-10-10 22:10:32,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ef58a553/80ec536728ba4ce68c5820246f838f61 [2024-10-10 22:10:32,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:10:32,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:10:32,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:10:32,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:10:32,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:10:32,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76988b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32, skipping insertion in model container [2024-10-10 22:10:32,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:10:32,390 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-multidimensional/copy-3-n-u.c[322,335] [2024-10-10 22:10:32,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:10:32,432 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:10:32,441 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-multidimensional/copy-3-n-u.c[322,335] [2024-10-10 22:10:32,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:10:32,473 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:10:32,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32 WrapperNode [2024-10-10 22:10:32,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:10:32,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:10:32,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:10:32,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:10:32,481 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:10:32" (1/1) ... [2024-10-10 22:10:32,487 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:10:32" (1/1) ... [2024-10-10 22:10:32,510 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-10-10 22:10:32,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:10:32,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:10:32,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:10:32,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:10:32,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,540 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-10 22:10:32,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:10:32,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:10:32,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:10:32,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:10:32,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (1/1) ... [2024-10-10 22:10:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:10:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:32,623 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:10:32,625 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:10:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:10:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:10:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-10 22:10:32,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-10 22:10:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-10 22:10:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-10 22:10:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-10 22:10:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-10 22:10:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:10:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:10:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-10 22:10:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-10 22:10:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-10 22:10:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-10 22:10:32,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:10:32,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:10:33,067 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-10 22:10:33,068 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:10:33,114 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:10:33,121 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-10 22:10:33,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:10:33 BoogieIcfgContainer [2024-10-10 22:10:33,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:10:33,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:10:33,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:10:33,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:10:33,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:10:32" (1/3) ... [2024-10-10 22:10:33,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175d23d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:10:33, skipping insertion in model container [2024-10-10 22:10:33,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:10:32" (2/3) ... [2024-10-10 22:10:33,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175d23d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:10:33, skipping insertion in model container [2024-10-10 22:10:33,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:10:33" (3/3) ... [2024-10-10 22:10:33,141 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2024-10-10 22:10:33,166 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:10:33,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:10:33,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:10:33,294 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;@62683bea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:10:33,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:10:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:10:33,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:33,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:33,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:33,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash 237570459, now seen corresponding path program 1 times [2024-10-10 22:10:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184348453] [2024-10-10 22:10:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:33,480 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:10:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:33,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184348453] [2024-10-10 22:10:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184348453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:10:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816557340] [2024-10-10 22:10:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:33,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:10:33,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:33,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:10:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:10:33,507 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:33,529 INFO L93 Difference]: Finished difference Result 47 states and 83 transitions. [2024-10-10 22:10:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:10:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 22:10:33,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:33,537 INFO L225 Difference]: With dead ends: 47 [2024-10-10 22:10:33,537 INFO L226 Difference]: Without dead ends: 22 [2024-10-10 22:10:33,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:10:33,542 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:33,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-10 22:10:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-10 22:10:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-10-10 22:10:33,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 10 [2024-10-10 22:10:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:33,568 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-10-10 22:10:33,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-10-10 22:10:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:10:33,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:33,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:10:33,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:33,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:33,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1373370499, now seen corresponding path program 1 times [2024-10-10 22:10:33,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:33,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401351739] [2024-10-10 22:10:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:33,685 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:10:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401351739] [2024-10-10 22:10:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401351739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:10:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590589198] [2024-10-10 22:10:33,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:10:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:10:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:10:33,689 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:33,723 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-10 22:10:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:10:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2024-10-10 22:10:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:33,725 INFO L225 Difference]: With dead ends: 43 [2024-10-10 22:10:33,725 INFO L226 Difference]: Without dead ends: 27 [2024-10-10 22:10:33,725 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:10:33,726 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:33,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-10 22:10:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-10 22:10:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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:10:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-10 22:10:33,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2024-10-10 22:10:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:33,732 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-10 22:10:33,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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:10:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-10 22:10:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:10:33,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:33,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:33,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:10:33,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:33,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash 84443277, now seen corresponding path program 1 times [2024-10-10 22:10:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:33,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659821165] [2024-10-10 22:10:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659821165] [2024-10-10 22:10:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659821165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:33,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988005972] [2024-10-10 22:10:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:33,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:33,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:33,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:33,819 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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:10:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:33,862 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-10-10 22:10:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:33,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-10 22:10:33,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:33,864 INFO L225 Difference]: With dead ends: 57 [2024-10-10 22:10:33,864 INFO L226 Difference]: Without dead ends: 36 [2024-10-10 22:10:33,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:10:33,865 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:33,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-10 22:10:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2024-10-10 22:10:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 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:10:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2024-10-10 22:10:33,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 13 [2024-10-10 22:10:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:33,871 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2024-10-10 22:10:33,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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:10:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2024-10-10 22:10:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-10 22:10:33,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:33,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:33,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:10:33,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:33,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -426887717, now seen corresponding path program 1 times [2024-10-10 22:10:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778111145] [2024-10-10 22:10:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:10:33,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778111145] [2024-10-10 22:10:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778111145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954767556] [2024-10-10 22:10:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:33,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:33,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:33,945 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:10:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:33,977 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2024-10-10 22:10:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-10 22:10:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:33,978 INFO L225 Difference]: With dead ends: 57 [2024-10-10 22:10:33,978 INFO L226 Difference]: Without dead ends: 33 [2024-10-10 22:10:33,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:10:33,980 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:33,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-10 22:10:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-10 22:10:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-10 22:10:33,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-10-10 22:10:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-10 22:10:33,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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:10:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-10 22:10:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-10 22:10:33,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:33,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:10:33,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:33,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 704489342, now seen corresponding path program 1 times [2024-10-10 22:10:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:33,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170440165] [2024-10-10 22:10:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:33,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170440165] [2024-10-10 22:10:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170440165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:10:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:10:34,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:10:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140669049] [2024-10-10 22:10:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:10:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:10:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:10:34,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:10:34,099 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:10:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:34,153 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2024-10-10 22:10:34,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:10:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-10 22:10:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:34,154 INFO L225 Difference]: With dead ends: 65 [2024-10-10 22:10:34,154 INFO L226 Difference]: Without dead ends: 53 [2024-10-10 22:10:34,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:10:34,155 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:34,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:10:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-10 22:10:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2024-10-10 22:10:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-10-10 22:10:34,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-10-10 22:10:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:34,161 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-10-10 22:10:34,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:10:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-10-10 22:10:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:10:34,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:34,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:34,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:10:34,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:34,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -835513290, now seen corresponding path program 1 times [2024-10-10 22:10:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230645921] [2024-10-10 22:10:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230645921] [2024-10-10 22:10:34,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230645921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240362035] [2024-10-10 22:10:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:34,258 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:10:34,260 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:10:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:34,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:10:34,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:34,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:10:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240362035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:34,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:34,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-10-10 22:10:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598363501] [2024-10-10 22:10:34,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:34,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:10:34,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:34,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:10:34,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:10:34,433 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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:10:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:34,518 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2024-10-10 22:10:34,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:10:34,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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 24 [2024-10-10 22:10:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:34,519 INFO L225 Difference]: With dead ends: 79 [2024-10-10 22:10:34,519 INFO L226 Difference]: Without dead ends: 51 [2024-10-10 22:10:34,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:10:34,520 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 116 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:34,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 79 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:34,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-10 22:10:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-10 22:10:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-10-10 22:10:34,556 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2024-10-10 22:10:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:34,558 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-10 22:10:34,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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:10:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-10-10 22:10:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-10 22:10:34,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:34,559 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:34,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:10:34,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:34,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:34,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -364596391, now seen corresponding path program 2 times [2024-10-10 22:10:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:34,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847235039] [2024-10-10 22:10:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:34,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:34,947 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:10:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847235039] [2024-10-10 22:10:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847235039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:34,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825537933] [2024-10-10 22:10:34,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:10:34,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:34,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:34,949 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:10:34,951 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:10:35,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:10:35,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:35,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:10:35,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:10:35,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:10:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825537933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:35,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-10-10 22:10:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824065501] [2024-10-10 22:10:35,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:35,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:10:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:10:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:10:35,154 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:35,363 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2024-10-10 22:10:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:10:35,364 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-10 22:10:35,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:35,365 INFO L225 Difference]: With dead ends: 136 [2024-10-10 22:10:35,366 INFO L226 Difference]: Without dead ends: 93 [2024-10-10 22:10:35,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:10:35,367 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 177 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:35,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 119 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-10 22:10:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2024-10-10 22:10:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 0 states have call successors, (0), 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:10:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-10-10 22:10:35,384 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 30 [2024-10-10 22:10:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-10-10 22:10:35,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:10:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2024-10-10 22:10:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:10:35,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:35,386 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:35,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:10:35,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:35,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:35,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2131532679, now seen corresponding path program 3 times [2024-10-10 22:10:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077704051] [2024-10-10 22:10:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-10 22:10:35,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077704051] [2024-10-10 22:10:35,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077704051] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:35,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697990131] [2024-10-10 22:10:35,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:10:35,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:35,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:35,879 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:10:35,882 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:10:35,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-10 22:10:35,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:35,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:10:35,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 22:10:36,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:10:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-10 22:10:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697990131] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:10:36,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:10:36,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 3, 3] total 17 [2024-10-10 22:10:36,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561322214] [2024-10-10 22:10:36,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:10:36,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-10 22:10:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:10:36,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-10 22:10:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:10:36,082 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:10:36,922 INFO L93 Difference]: Finished difference Result 228 states and 268 transitions. [2024-10-10 22:10:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-10 22:10:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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 42 [2024-10-10 22:10:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:10:36,924 INFO L225 Difference]: With dead ends: 228 [2024-10-10 22:10:36,924 INFO L226 Difference]: Without dead ends: 155 [2024-10-10 22:10:36,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1355, Invalid=2935, Unknown=0, NotChecked=0, Total=4290 [2024-10-10 22:10:36,942 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 358 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:10:36,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 93 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:10:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-10 22:10:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2024-10-10 22:10:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1923076923076923) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 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:10:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2024-10-10 22:10:36,974 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 42 [2024-10-10 22:10:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:10:36,974 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2024-10-10 22:10:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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:10:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2024-10-10 22:10:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-10 22:10:36,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:10:36,978 INFO L215 NwaCegarLoop]: trace histogram [44, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:10:36,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:10:37,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:37,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:10:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:10:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash 676157847, now seen corresponding path program 4 times [2024-10-10 22:10:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:10:37,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645099337] [2024-10-10 22:10:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:10:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:10:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:10:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 443 proven. 66 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2024-10-10 22:10:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:10:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645099337] [2024-10-10 22:10:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645099337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:10:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925608031] [2024-10-10 22:10:37,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-10 22:10:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:10:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:10:37,706 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:10:37,711 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 22:10:37,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-10 22:10:37,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:10:37,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-10 22:10:37,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:10:37,995 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 15 treesize of output 11 [2024-10-10 22:10:38,066 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,148 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,226 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,301 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,395 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,476 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,558 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,624 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,697 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,757 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-10 22:10:38,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2024-10-10 22:10:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 45 proven. 23 refuted. 0 times theorem prover too weak. 1178 trivial. 0 not checked. [2024-10-10 22:10:38,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:11:32,536 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 Int) (|v_ULTIMATE.start_main_~k~0#1_159| Int) (v_ArrVal_409 Int) (|v_ULTIMATE.start_main_~k~0#1_157| Int) (|v_ULTIMATE.start_main_~k~0#1_158| Int) (v_ArrVal_415 Int) (v_ArrVal_414 Int)) (or (< |v_ULTIMATE.start_main_~k~0#1_159| (+ |c_ULTIMATE.start_main_~k~0#1| 1)) (< |v_ULTIMATE.start_main_~k~0#1_157| (+ |v_ULTIMATE.start_main_~k~0#1_158| 1)) (< |v_ULTIMATE.start_main_~k~0#1_158| (+ |v_ULTIMATE.start_main_~k~0#1_159| 1)) (= (select (let ((.cse2 (* |c_ULTIMATE.start_main_~p~0#1| 4))) (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| .cse2)) (.cse1 (* (* |c_ULTIMATE.start_main_~n~0#1| .cse2) |c_ULTIMATE.start_main_~i~0#1|))) (store (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#A~0#1.base|) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |c_ULTIMATE.start_main_~k~0#1|)) v_ArrVal_409) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_159|) .cse0 .cse1) v_ArrVal_411) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| (* 4 |v_ULTIMATE.start_main_~k~0#1_158|) .cse0 .cse1) v_ArrVal_414) (+ |c_ULTIMATE.start_main_~#A~0#1.offset| .cse0 .cse1 (* 4 |v_ULTIMATE.start_main_~k~0#1_157|)) v_ArrVal_415))) |c_ULTIMATE.start_main_~#A~0#1.offset|) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#B~0#1.base|) |c_ULTIMATE.start_main_~#B~0#1.offset|)))) is different from false