./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-fpi/s2iff.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s2iff.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 3c2c79fc7da9b912a6d0a49c4075c07cb5e82cc2dc05ee24d0b572e0ac73f733 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 17:09:28,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:09:28,508 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:09:28,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:09:28,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:09:28,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:09:28,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:09:28,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:09:28,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:09:28,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:09:28,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:09:28,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:09:28,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:09:28,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:09:28,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:09:28,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:09:28,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:09:28,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:09:28,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:09:28,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:09:28,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:09:28,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:09:28,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:09:28,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:09:28,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:09:28,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:09:28,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:09:28,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:09:28,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:09:28,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:09:28,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:09:28,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:09:28,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:09:28,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:09:28,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:09:28,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:09:28,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:09:28,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:09:28,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:09:28,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:09:28,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:09:28,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:09:28,554 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 -> 3c2c79fc7da9b912a6d0a49c4075c07cb5e82cc2dc05ee24d0b572e0ac73f733 [2024-11-19 17:09:28,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:09:28,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:09:28,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:09:28,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:09:28,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:09:28,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s2iff.c [2024-11-19 17:09:30,199 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:09:30,371 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:09:30,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s2iff.c [2024-11-19 17:09:30,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4695e45ed/f3aec02ad0be4e8994d1371eaeb73e21/FLAG665132fe3 [2024-11-19 17:09:30,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4695e45ed/f3aec02ad0be4e8994d1371eaeb73e21 [2024-11-19 17:09:30,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:09:30,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:09:30,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:09:30,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:09:30,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:09:30,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:09:30" (1/1) ... [2024-11-19 17:09:30,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1beb4312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:30, skipping insertion in model container [2024-11-19 17:09:30,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:09:30" (1/1) ... [2024-11-19 17:09:30,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:09:30,965 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/array-fpi/s2iff.c[588,601] [2024-11-19 17:09:30,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:09:30,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:09:31,011 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/array-fpi/s2iff.c[588,601] [2024-11-19 17:09:31,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:09:31,039 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:09:31,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31 WrapperNode [2024-11-19 17:09:31,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:09:31,041 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:09:31,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:09:31,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:09:31,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,082 INFO L138 Inliner]: procedures = 17, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-11-19 17:09:31,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:09:31,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:09:31,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:09:31,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:09:31,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,113 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 8, 6, 4]. 40 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 4 writes are split as follows [0, 0, 3, 1]. [2024-11-19 17:09:31,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:09:31,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:09:31,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:09:31,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:09:31,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (1/1) ... [2024-11-19 17:09:31,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:09:31,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:09:31,188 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-19 17:09:31,191 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-19 17:09:31,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 17:09:31,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 17:09:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 17:09:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 17:09:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 17:09:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 17:09:31,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:09:31,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:09:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 17:09:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 17:09:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 17:09:31,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 17:09:31,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 17:09:31,311 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:09:31,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:09:31,441 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-19 17:09:31,441 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:09:31,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:09:31,453 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:09:31,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:31 BoogieIcfgContainer [2024-11-19 17:09:31,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:09:31,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:09:31,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:09:31,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:09:31,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:09:30" (1/3) ... [2024-11-19 17:09:31,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45935d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:09:31, skipping insertion in model container [2024-11-19 17:09:31,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:09:31" (2/3) ... [2024-11-19 17:09:31,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45935d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:09:31, skipping insertion in model container [2024-11-19 17:09:31,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:31" (3/3) ... [2024-11-19 17:09:31,466 INFO L112 eAbstractionObserver]: Analyzing ICFG s2iff.c [2024-11-19 17:09:31,480 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:09:31,480 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:09:31,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:09:31,564 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;@40b0483f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:09:31,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:09:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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-19 17:09:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 17:09:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:31,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:31,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:31,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2024-11-19 17:09:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633749569] [2024-11-19 17:09:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:31,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:31,749 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-19 17:09:31,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633749569] [2024-11-19 17:09:31,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633749569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:09:31,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:09:31,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 17:09:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704615763] [2024-11-19 17:09:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:09:31,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 17:09:31,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 17:09:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 17:09:31,779 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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.5) internal successors, (11), 2 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-19 17:09:31,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:31,792 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-11-19 17:09:31,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 17:09:31,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-19 17:09:31,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:31,799 INFO L225 Difference]: With dead ends: 34 [2024-11-19 17:09:31,799 INFO L226 Difference]: Without dead ends: 15 [2024-11-19 17:09:31,802 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-11-19 17:09:31,805 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:31,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:09:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-19 17:09:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-19 17:09:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-11-19 17:09:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-11-19 17:09:31,832 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-11-19 17:09:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:31,832 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-11-19 17:09:31,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-19 17:09:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-11-19 17:09:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 17:09:31,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:31,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:31,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 17:09:31,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:31,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2024-11-19 17:09:31,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426102526] [2024-11-19 17:09:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:31,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:32,007 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-19 17:09:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:32,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426102526] [2024-11-19 17:09:32,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426102526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:09:32,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:09:32,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 17:09:32,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201132917] [2024-11-19 17:09:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:09:32,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 17:09:32,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 17:09:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 17:09:32,012 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 17:09:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:32,069 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-19 17:09:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 17:09:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 17:09:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:32,070 INFO L225 Difference]: With dead ends: 28 [2024-11-19 17:09:32,071 INFO L226 Difference]: Without dead ends: 20 [2024-11-19 17:09:32,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-19 17:09:32,072 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:32,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:09:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-19 17:09:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-11-19 17:09:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 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-19 17:09:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-19 17:09:32,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-19 17:09:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:32,083 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-19 17:09:32,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-19 17:09:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-19 17:09:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 17:09:32,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:32,084 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:32,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:09:32,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:32,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2024-11-19 17:09:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859093067] [2024-11-19 17:09:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:32,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859093067] [2024-11-19 17:09:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859093067] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:09:32,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812133073] [2024-11-19 17:09:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:32,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:09:32,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:09:32,766 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-19 17:09:32,768 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-19 17:09:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:32,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 17:09:32,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:09:32,917 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 11 treesize of output 7 [2024-11-19 17:09:33,057 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 17:09:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:33,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:09:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812133073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:09:33,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:09:33,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2024-11-19 17:09:33,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651713371] [2024-11-19 17:09:33,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:09:33,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 17:09:33,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:33,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 17:09:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 17:09:33,296 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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-19 17:09:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:33,534 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-19 17:09:33,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 17:09:33,534 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-19 17:09:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:33,535 INFO L225 Difference]: With dead ends: 31 [2024-11-19 17:09:33,535 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 17:09:33,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-19 17:09:33,537 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:33,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 43 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:09:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 17:09:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-19 17:09:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 17:09:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-19 17:09:33,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2024-11-19 17:09:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:33,543 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-19 17:09:33,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 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-19 17:09:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-19 17:09:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 17:09:33,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:33,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:33,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 17:09:33,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:09:33,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:33,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2024-11-19 17:09:33,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:33,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337966174] [2024-11-19 17:09:33,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:33,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:33,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:33,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337966174] [2024-11-19 17:09:33,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337966174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:09:33,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439007873] [2024-11-19 17:09:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:33,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:09:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:09:33,928 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-19 17:09:33,930 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-19 17:09:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:33,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 17:09:33,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:09:34,004 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 11 treesize of output 7 [2024-11-19 17:09:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:34,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:09:34,069 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 14 treesize of output 12 [2024-11-19 17:09:34,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-19 17:09:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439007873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:09:34,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:09:34,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-19 17:09:34,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199654690] [2024-11-19 17:09:34,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:09:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 17:09:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 17:09:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 17:09:34,088 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-19 17:09:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:34,151 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-19 17:09:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 17:09:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-11-19 17:09:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:34,152 INFO L225 Difference]: With dead ends: 33 [2024-11-19 17:09:34,152 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 17:09:34,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 17:09:34,153 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:34,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:09:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 17:09:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-19 17:09:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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-19 17:09:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-19 17:09:34,159 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2024-11-19 17:09:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:34,160 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-19 17:09:34,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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-19 17:09:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-19 17:09:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 17:09:34,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:34,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:34,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 17:09:34,361 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-19 17:09:34,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:34,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2024-11-19 17:09:34,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:34,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179207311] [2024-11-19 17:09:34,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:34,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:34,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179207311] [2024-11-19 17:09:34,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179207311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:09:34,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149608764] [2024-11-19 17:09:34,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:09:34,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:09:34,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:09:34,443 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-19 17:09:34,445 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-19 17:09:34,509 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:09:34,510 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:09:34,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 17:09:34,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:09:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:34,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:09:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149608764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:09:34,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:09:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-19 17:09:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102743151] [2024-11-19 17:09:34,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:09:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:09:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:34,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:09:34,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:09:34,624 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-11-19 17:09:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:34,743 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-11-19 17:09:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:09:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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) Word has length 18 [2024-11-19 17:09:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:34,744 INFO L225 Difference]: With dead ends: 33 [2024-11-19 17:09:34,745 INFO L226 Difference]: Without dead ends: 29 [2024-11-19 17:09:34,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-19 17:09:34,746 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:34,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 25 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:09:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-19 17:09:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2024-11-19 17:09:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 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-19 17:09:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-19 17:09:34,752 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2024-11-19 17:09:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:34,752 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-19 17:09:34,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 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-11-19 17:09:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-19 17:09:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 17:09:34,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:34,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:34,761 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-19 17:09:34,953 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-19 17:09:34,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:34,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2024-11-19 17:09:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075003079] [2024-11-19 17:09:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:09:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:35,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:09:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075003079] [2024-11-19 17:09:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075003079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:09:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249121717] [2024-11-19 17:09:35,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 17:09:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:09:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:09:35,047 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-19 17:09:35,048 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-19 17:09:35,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 17:09:35,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:09:35,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 17:09:35,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:09:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:35,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:09:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 17:09:35,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249121717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:09:35,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:09:35,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-19 17:09:35,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712345108] [2024-11-19 17:09:35,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:09:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:09:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:09:35,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:09:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:09:35,194 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-11-19 17:09:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:09:35,268 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-19 17:09:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 17:09:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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) Word has length 19 [2024-11-19 17:09:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:09:35,269 INFO L225 Difference]: With dead ends: 37 [2024-11-19 17:09:35,269 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 17:09:35,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-19 17:09:35,270 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:09:35,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:09:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 17:09:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-19 17:09:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-19 17:09:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-19 17:09:35,275 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2024-11-19 17:09:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:09:35,275 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-19 17:09:35,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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-11-19 17:09:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-19 17:09:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 17:09:35,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:09:35,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:09:35,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 17:09:35,477 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-19 17:09:35,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:09:35,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:09:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2024-11-19 17:09:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:09:35,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698687421] [2024-11-19 17:09:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:09:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:09:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:09:35,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 17:09:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:09:35,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 17:09:35,530 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 17:09:35,531 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:09:35,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:09:35,535 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-11-19 17:09:35,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:09:35,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:09:35 BoogieIcfgContainer [2024-11-19 17:09:35,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:09:35,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:09:35,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:09:35,564 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:09:35,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:09:31" (3/4) ... [2024-11-19 17:09:35,565 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 17:09:35,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 17:09:35,608 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:09:35,608 INFO L158 Benchmark]: Toolchain (without parser) took 4837.27ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 95.2MB in the beginning and 120.9MB in the end (delta: -25.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,608 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:09:35,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.93ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 82.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,609 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.72ms. Allocated memory is still 151.0MB. Free memory was 82.3MB in the beginning and 80.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,609 INFO L158 Benchmark]: Boogie Preprocessor took 59.88ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 78.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,610 INFO L158 Benchmark]: RCFGBuilder took 310.36ms. Allocated memory is still 151.0MB. Free memory was 78.4MB in the beginning and 65.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,610 INFO L158 Benchmark]: TraceAbstraction took 4105.71ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 65.1MB in the beginning and 123.0MB in the end (delta: -57.8MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,610 INFO L158 Benchmark]: Witness Printer took 43.53ms. Allocated memory is still 211.8MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:09:35,612 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.17ms. Allocated memory is still 151.0MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.93ms. Allocated memory is still 151.0MB. Free memory was 95.2MB in the beginning and 82.3MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.72ms. Allocated memory is still 151.0MB. Free memory was 82.3MB in the beginning and 80.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.88ms. Allocated memory is still 151.0MB. Free memory was 80.5MB in the beginning and 78.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.36ms. Allocated memory is still 151.0MB. Free memory was 78.4MB in the beginning and 65.5MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4105.71ms. Allocated memory was 151.0MB in the beginning and 211.8MB in the end (delta: 60.8MB). Free memory was 65.1MB in the beginning and 123.0MB in the end (delta: -57.8MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Witness Printer took 43.53ms. Allocated memory is still 211.8MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int N; VAL [N=0] [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND FALSE !(!cond) VAL [N=2] [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] long long sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [N=2, a={-1:0}, i=0, sum={9:0}] [L32] COND TRUE i