./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test25-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test25-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 12:59:38,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 12:59:38,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 12:59:38,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 12:59:38,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 12:59:38,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 12:59:38,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 12:59:38,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 12:59:38,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 12:59:38,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 12:59:38,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 12:59:38,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 12:59:38,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 12:59:38,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 12:59:38,376 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 12:59:38,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 12:59:38,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 12:59:38,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 12:59:38,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 12:59:38,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 12:59:38,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 12:59:38,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 12:59:38,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 12:59:38,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 12:59:38,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 12:59:38,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 12:59:38,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 12:59:38,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 12:59:38,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 12:59:38,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 12:59:38,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 12:59:38,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 12:59:38,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:59:38,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 12:59:38,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 12:59:38,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 12:59:38,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 12:59:38,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 12:59:38,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 12:59:38,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 12:59:38,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 12:59:38,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 12:59:38,391 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/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/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 -> de251549242251e9f54823879039d01198e32edde0d5daa52ae9e52ec83fdcc8 [2024-11-18 12:59:38,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 12:59:38,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 12:59:38,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 12:59:38,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 12:59:38,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 12:59:38,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-1.c [2024-11-18 12:59:40,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 12:59:40,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 12:59:40,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c [2024-11-18 12:59:40,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac13c20c8/637c9aea900d44f38a22da8dcefa5a0d/FLAG47f7e5b99 [2024-11-18 12:59:40,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac13c20c8/637c9aea900d44f38a22da8dcefa5a0d [2024-11-18 12:59:40,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 12:59:40,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 12:59:40,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:40,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 12:59:40,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 12:59:40,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:40,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c78129d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40, skipping insertion in model container [2024-11-18 12:59:40,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:40,669 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 12:59:40,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c[936,949] [2024-11-18 12:59:40,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:40,907 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 12:59:40,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-1.c[936,949] [2024-11-18 12:59:40,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 12:59:40,951 INFO L204 MainTranslator]: Completed translation [2024-11-18 12:59:40,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40 WrapperNode [2024-11-18 12:59:40,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 12:59:40,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:40,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 12:59:40,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 12:59:40,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:40,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,013 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2024-11-18 12:59:41,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 12:59:41,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 12:59:41,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 12:59:41,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 12:59:41,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,045 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 6, 4]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-18 12:59:41,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 12:59:41,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 12:59:41,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 12:59:41,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 12:59:41,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (1/1) ... [2024-11-18 12:59:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 12:59:41,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:41,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 12:59:41,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 12:59:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 12:59:41,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 12:59:41,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 12:59:41,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 12:59:41,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 12:59:41,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 12:59:41,305 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 12:59:41,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 12:59:41,507 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-18 12:59:41,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 12:59:41,522 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 12:59:41,522 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 12:59:41,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:41 BoogieIcfgContainer [2024-11-18 12:59:41,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 12:59:41,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 12:59:41,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 12:59:41,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 12:59:41,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:59:40" (1/3) ... [2024-11-18 12:59:41,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10309f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:41, skipping insertion in model container [2024-11-18 12:59:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:59:40" (2/3) ... [2024-11-18 12:59:41,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10309f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:59:41, skipping insertion in model container [2024-11-18 12:59:41,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:41" (3/3) ... [2024-11-18 12:59:41,536 INFO L112 eAbstractionObserver]: Analyzing ICFG test25-1.c [2024-11-18 12:59:41,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 12:59:41,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 12:59:41,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 12:59:41,630 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;@279ace82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 12:59:41,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 12:59:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 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-11-18 12:59:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-18 12:59:41,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:41,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:41,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:41,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash 621535585, now seen corresponding path program 1 times [2024-11-18 12:59:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:41,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203683328] [2024-11-18 12:59:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:41,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:59:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:41,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203683328] [2024-11-18 12:59:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203683328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:41,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:41,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 12:59:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414782034] [2024-11-18 12:59:41,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:41,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 12:59:41,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 12:59:41,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 12:59:41,970 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-18 12:59:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:42,000 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-11-18 12:59:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 12:59:42,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-18 12:59:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:42,010 INFO L225 Difference]: With dead ends: 34 [2024-11-18 12:59:42,010 INFO L226 Difference]: Without dead ends: 16 [2024-11-18 12:59:42,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 12:59:42,017 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:42,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-18 12:59:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-18 12:59:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-11-18 12:59:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-18 12:59:42,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-18 12:59:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-18 12:59:42,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-18 12:59:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-18 12:59:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 12:59:42,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:42,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:42,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 12:59:42,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:42,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash -697909696, now seen corresponding path program 1 times [2024-11-18 12:59:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112887648] [2024-11-18 12:59:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:42,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:59:42,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112887648] [2024-11-18 12:59:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112887648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561147799] [2024-11-18 12:59:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:42,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:42,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 12:59:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:42,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 12:59:42,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:59:42,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 12:59:42,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561147799] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:42,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:42,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-18 12:59:42,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506063829] [2024-11-18 12:59:42,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:42,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 12:59:42,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:42,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 12:59:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 12:59:42,476 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-11-18 12:59:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:42,514 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-18 12:59:42,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 12:59:42,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 14 [2024-11-18 12:59:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:42,515 INFO L225 Difference]: With dead ends: 31 [2024-11-18 12:59:42,515 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 12:59:42,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 12:59:42,517 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:42,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 12:59:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-18 12:59:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 12:59:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-11-18 12:59:42,521 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2024-11-18 12:59:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-11-18 12:59:42,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-11-18 12:59:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-11-18 12:59:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 12:59:42,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:42,523 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:42,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 12:59:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:42,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1008332474, now seen corresponding path program 2 times [2024-11-18 12:59:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870784953] [2024-11-18 12:59:42,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:42,785 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 12:59:42,788 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-18 12:59:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:43,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870784953] [2024-11-18 12:59:43,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870784953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 12:59:43,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 12:59:43,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 12:59:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198718166] [2024-11-18 12:59:43,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 12:59:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 12:59:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 12:59:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 12:59:43,120 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-18 12:59:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:43,165 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-18 12:59:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 12:59:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 12:59:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:43,167 INFO L225 Difference]: With dead ends: 28 [2024-11-18 12:59:43,168 INFO L226 Difference]: Without dead ends: 23 [2024-11-18 12:59:43,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 12:59:43,170 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:43,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 12:59:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-18 12:59:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-18 12:59:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 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-11-18 12:59:43,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-18 12:59:43,176 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2024-11-18 12:59:43,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:43,176 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-18 12:59:43,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-18 12:59:43,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-18 12:59:43,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 12:59:43,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:43,178 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:43,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 12:59:43,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:43,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:43,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1130070165, now seen corresponding path program 1 times [2024-11-18 12:59:43,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:43,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951678405] [2024-11-18 12:59:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:43,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 12:59:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951678405] [2024-11-18 12:59:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951678405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22958549] [2024-11-18 12:59:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 12:59:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:43,360 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:43,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 12:59:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 12:59:43,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 12:59:43,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 12:59:43,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 12:59:43,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22958549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:43,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:43,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-18 12:59:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987376526] [2024-11-18 12:59:43,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:43,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 12:59:43,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:43,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 12:59:43,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-18 12:59:43,617 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-11-18 12:59:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:43,679 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2024-11-18 12:59:43,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-18 12:59:43,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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) Word has length 22 [2024-11-18 12:59:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:43,682 INFO L225 Difference]: With dead ends: 47 [2024-11-18 12:59:43,682 INFO L226 Difference]: Without dead ends: 35 [2024-11-18 12:59:43,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-18 12:59:43,683 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:43,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:59:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-18 12:59:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-18 12:59:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 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-11-18 12:59:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-18 12:59:43,691 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 22 [2024-11-18 12:59:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:43,691 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-18 12:59:43,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-11-18 12:59:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-18 12:59:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 12:59:43,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:43,692 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:43,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 12:59:43,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-18 12:59:43,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:43,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2037252873, now seen corresponding path program 2 times [2024-11-18 12:59:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564441007] [2024-11-18 12:59:43,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:44,004 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:44,004 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-18 12:59:44,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564441007] [2024-11-18 12:59:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564441007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368496255] [2024-11-18 12:59:44,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 12:59:44,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:44,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:44,611 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:44,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 12:59:44,799 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 12:59:44,799 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:44,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-18 12:59:44,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:45,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2024-11-18 12:59:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 12:59:45,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:45,451 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-18 12:59:45,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2024-11-18 12:59:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-18 12:59:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368496255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:45,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 6] total 23 [2024-11-18 12:59:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813146952] [2024-11-18 12:59:45,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:45,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 12:59:45,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 12:59:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-11-18 12:59:45,486 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-18 12:59:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:45,913 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-18 12:59:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-18 12:59:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 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 34 [2024-11-18 12:59:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:45,915 INFO L225 Difference]: With dead ends: 46 [2024-11-18 12:59:45,915 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 12:59:45,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2024-11-18 12:59:45,916 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 12:59:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 12:59:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-18 12:59:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 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-11-18 12:59:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-18 12:59:45,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2024-11-18 12:59:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-18 12:59:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-18 12:59:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-18 12:59:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 12:59:45,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:45,932 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:45,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 12:59:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:46,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1151373594, now seen corresponding path program 3 times [2024-11-18 12:59:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045963161] [2024-11-18 12:59:46,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 12:59:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:46,188 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 12:59:46,188 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-18 12:59:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 12:59:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045963161] [2024-11-18 12:59:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045963161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 12:59:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909029420] [2024-11-18 12:59:46,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-18 12:59:46,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:46,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 12:59:46,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 12:59:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 12:59:46,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-18 12:59:46,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 12:59:46,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-18 12:59:46,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 12:59:47,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-18 12:59:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-18 12:59:47,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 12:59:47,177 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-18 12:59:47,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2024-11-18 12:59:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-18 12:59:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909029420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 12:59:47,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 12:59:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2024-11-18 12:59:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945454118] [2024-11-18 12:59:47,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 12:59:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-18 12:59:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 12:59:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-18 12:59:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2024-11-18 12:59:47,188 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-18 12:59:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 12:59:47,485 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-18 12:59:47,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-18 12:59:47,485 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 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 40 [2024-11-18 12:59:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 12:59:47,486 INFO L225 Difference]: With dead ends: 58 [2024-11-18 12:59:47,486 INFO L226 Difference]: Without dead ends: 53 [2024-11-18 12:59:47,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=442, Invalid=1040, Unknown=0, NotChecked=0, Total=1482 [2024-11-18 12:59:47,488 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 12:59:47,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 79 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 12:59:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-18 12:59:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-18 12:59:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0384615384615385) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-18 12:59:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-11-18 12:59:47,500 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 40 [2024-11-18 12:59:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 12:59:47,501 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-11-18 12:59:47,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 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-11-18 12:59:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-18 12:59:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-18 12:59:47,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 12:59:47,502 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 12:59:47,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 12:59:47,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 12:59:47,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 12:59:47,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 12:59:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1359246596, now seen corresponding path program 4 times [2024-11-18 12:59:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 12:59:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967079041] [2024-11-18 12:59:47,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-18 12:59:47,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 12:59:47,829 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-18 12:59:47,829 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 12:59:47,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 12:59:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 12:59:47,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 12:59:47,914 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 12:59:47,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 12:59:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 12:59:47,921 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1] [2024-11-18 12:59:47,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 12:59:47,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 12:59:47 BoogieIcfgContainer [2024-11-18 12:59:47,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 12:59:47,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 12:59:47,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 12:59:47,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 12:59:47,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:59:41" (3/4) ... [2024-11-18 12:59:47,974 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 12:59:48,025 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 12:59:48,026 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 12:59:48,027 INFO L158 Benchmark]: Toolchain (without parser) took 7389.29ms. Allocated memory was 134.2MB in the beginning and 234.9MB in the end (delta: 100.7MB). Free memory was 64.4MB in the beginning and 160.5MB in the end (delta: -96.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,030 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 12:59:48,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.71ms. Allocated memory is still 134.2MB. Free memory was 64.4MB in the beginning and 51.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 51.4MB in the beginning and 166.9MB in the end (delta: -115.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,031 INFO L158 Benchmark]: Boogie Preprocessor took 56.43ms. Allocated memory is still 195.0MB. Free memory was 166.8MB in the beginning and 165.9MB in the end (delta: 881.1kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,031 INFO L158 Benchmark]: RCFGBuilder took 451.53ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 151.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,031 INFO L158 Benchmark]: TraceAbstraction took 6445.39ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 151.3MB in the beginning and 164.7MB in the end (delta: -13.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,032 INFO L158 Benchmark]: Witness Printer took 53.49ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 160.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 12:59:48,033 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.71ms. Allocated memory is still 134.2MB. Free memory was 64.4MB in the beginning and 51.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 51.4MB in the beginning and 166.9MB in the end (delta: -115.4MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.43ms. Allocated memory is still 195.0MB. Free memory was 166.8MB in the beginning and 165.9MB in the end (delta: 881.1kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 451.53ms. Allocated memory is still 195.0MB. Free memory was 165.9MB in the beginning and 151.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6445.39ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 151.3MB in the beginning and 164.7MB in the end (delta: -13.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 53.49ms. Allocated memory is still 234.9MB. Free memory was 164.7MB in the beginning and 160.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] struct cont cont; [L22] struct dummy array[10]; [L23] int i, *pa; [L24] i = __VERIFIER_nondet_int() [L26] int j = 0; VAL [array={6:0}, cont={5:0}, i=0, j=0] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=1] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=2] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=3] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=4] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=5] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=6] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=7] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=8] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=9] [L26] COND TRUE j < 10 [L27] array[j].a = __VERIFIER_nondet_int() [L28] array[j].b = __VERIFIER_nondet_int() [L26] j++ VAL [array={6:0}, cont={5:0}, i=0, j=10] [L26] COND FALSE !(j < 10) VAL [array={6:0}, cont={5:0}, i=0] [L31] COND TRUE i >= 0 && i < 9 [L32] cont.array = &array[i] [L33] EXPR cont.array [L33] pa = &cont.array[0].b [L34] EXPR cont.array [L34] EXPR cont.array[0].b [L34] COND TRUE cont.array[0].b > 0 [L35] EXPR array[i].b [L35] i = array[i].b - 10 [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=8, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=9, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=10, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=11, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=12, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=13, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=14, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=15, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=16, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND TRUE i < *pa [L37] ++i VAL [cont={5:0}, i=17, pa={6:4}] [L36] EXPR \read(*pa) [L36] COND FALSE !(i < *pa) [L39] CALL, EXPR check(&cont, i) [L16] EXPR pc->array [L16] EXPR pc->array[1].b [L16] return pc->array[1].b == i; [L39] RET, EXPR check(&cont, i) [L39] COND TRUE !check(&cont, i) [L47] reach_error() VAL [pa={6:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 491 IncrementalHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 76 mSDtfsCounter, 491 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=6, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 303 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 15 NumberOfNonLiveVariables, 981 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 526/739 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 12:59:48,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE