./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i --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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i -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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:47:35,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:47:35,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:47:35,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:47:35,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:47:35,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:47:35,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:47:35,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:47:35,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:47:35,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:47:35,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:47:35,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:47:35,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:47:35,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:47:35,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:47:35,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:47:35,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:47:35,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:47:35,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:47:35,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:47:35,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:47:35,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:47:35,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:47:35,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:47:35,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:47:35,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:47:35,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:47:35,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:47:35,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:47:35,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:47:35,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:47:35,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:47:35,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:47:35,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:47:35,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:47:35,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:47:35,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:47:35,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:47:35,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:47:35,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:47:35,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:47:35,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:47:35,182 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-11-18 22:47:35,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:47:35,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:47:35,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:47:35,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:47:35,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:47:35,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:36,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:47:36,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:47:36,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:36,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec8d4a19/bd717f4d57e64268810986b2391bf524/FLAG32bcdf19d [2024-11-18 22:47:36,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ec8d4a19/bd717f4d57e64268810986b2391bf524 [2024-11-18 22:47:36,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:47:36,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:47:36,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:47:36,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:47:36,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:47:36,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:36" (1/1) ... [2024-11-18 22:47:36,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd3a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:36, skipping insertion in model container [2024-11-18 22:47:36,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:36" (1/1) ... [2024-11-18 22:47:36,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:47:37,155 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-11-18 22:47:37,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:47:37,204 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:47:37,217 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-11-18 22:47:37,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:47:37,251 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:47:37,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37 WrapperNode [2024-11-18 22:47:37,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:47:37,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:47:37,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:47:37,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:47:37,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,306 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-18 22:47:37,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:47:37,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:47:37,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:47:37,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:47:37,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:47:37,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:47:37,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:47:37,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:47:37,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:47:37,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (1/1) ... [2024-11-18 22:47:37,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:47:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:47:37,407 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 22:47:37,410 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 22:47:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:47:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:47:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:47:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:47:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:47:37,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:47:37,542 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:47:37,544 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:47:37,872 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-18 22:47:37,873 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:47:37,886 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:47:37,887 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:47:37,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:37 BoogieIcfgContainer [2024-11-18 22:47:37,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:47:37,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:47:37,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:47:37,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:47:37,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:47:36" (1/3) ... [2024-11-18 22:47:37,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d061671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:37, skipping insertion in model container [2024-11-18 22:47:37,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:37" (2/3) ... [2024-11-18 22:47:37,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d061671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:37, skipping insertion in model container [2024-11-18 22:47:37,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:37" (3/3) ... [2024-11-18 22:47:37,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:37,912 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:47:37,912 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:47:37,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:47:37,983 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;@4ee04451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:47:37,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:47:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 22:47:37,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:38,001 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:38,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1153718418, now seen corresponding path program 1 times [2024-11-18 22:47:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85615340] [2024-11-18 22:47:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-18 22:47:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85615340] [2024-11-18 22:47:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85615340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:47:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802035949] [2024-11-18 22:47:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:38,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:47:38,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:47:38,252 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 22:47:38,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 22:47:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:38,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:47:38,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:47:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-18 22:47:38,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:47:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802035949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:47:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:47:38,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058387756] [2024-11-18 22:47:38,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:38,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:47:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:47:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:47:38,417 INFO L87 Difference]: Start difference. First operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 22:47:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:38,438 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2024-11-18 22:47:38,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:47:38,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2024-11-18 22:47:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:38,445 INFO L225 Difference]: With dead ends: 117 [2024-11-18 22:47:38,445 INFO L226 Difference]: Without dead ends: 56 [2024-11-18 22:47:38,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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-18 22:47:38,451 INFO L432 NwaCegarLoop]: 83 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, 83 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-18 22:47:38,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:47:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-18 22:47:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-18 22:47:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-18 22:47:38,488 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 90 [2024-11-18 22:47:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:38,489 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-18 22:47:38,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 22:47:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-18 22:47:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 22:47:38,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:38,493 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:38,507 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 22:47:38,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:47:38,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:38,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 895368340, now seen corresponding path program 1 times [2024-11-18 22:47:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:38,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130191372] [2024-11-18 22:47:38,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:38,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 22:47:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130191372] [2024-11-18 22:47:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130191372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:39,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 22:47:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412071303] [2024-11-18 22:47:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:39,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 22:47:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:39,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 22:47:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:47:39,849 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:40,382 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions. [2024-11-18 22:47:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 22:47:40,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-18 22:47:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:40,385 INFO L225 Difference]: With dead ends: 198 [2024-11-18 22:47:40,387 INFO L226 Difference]: Without dead ends: 145 [2024-11-18 22:47:40,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-18 22:47:40,389 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 254 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:40,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 232 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:47:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-18 22:47:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 62. [2024-11-18 22:47:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-18 22:47:40,405 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 90 [2024-11-18 22:47:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:40,408 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-18 22:47:40,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-18 22:47:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 22:47:40,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:40,410 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:47:40,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:40,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -879639022, now seen corresponding path program 1 times [2024-11-18 22:47:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:40,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686238159] [2024-11-18 22:47:40,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 22:47:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686238159] [2024-11-18 22:47:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686238159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:47:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906439380] [2024-11-18 22:47:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:47:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:41,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:47:41,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:47:41,369 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:41,577 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2024-11-18 22:47:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:47:41,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-18 22:47:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:41,579 INFO L225 Difference]: With dead ends: 149 [2024-11-18 22:47:41,580 INFO L226 Difference]: Without dead ends: 90 [2024-11-18 22:47:41,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:47:41,582 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:41,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:47:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-18 22:47:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2024-11-18 22:47:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-18 22:47:41,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 90 [2024-11-18 22:47:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:41,596 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-18 22:47:41,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-18 22:47:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-18 22:47:41,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:41,599 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:41,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:47:41,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:41,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 308562326, now seen corresponding path program 1 times [2024-11-18 22:47:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:41,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108030256] [2024-11-18 22:47:41,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:41,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:41,740 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 22:47:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108030256] [2024-11-18 22:47:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108030256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:47:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124103902] [2024-11-18 22:47:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:47:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:41,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:47:41,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:47:41,745 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:41,774 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions. [2024-11-18 22:47:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:47:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-11-18 22:47:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:41,776 INFO L225 Difference]: With dead ends: 157 [2024-11-18 22:47:41,776 INFO L226 Difference]: Without dead ends: 88 [2024-11-18 22:47:41,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:47:41,777 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:41,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:47:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-18 22:47:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-11-18 22:47:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2024-11-18 22:47:41,784 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 90 [2024-11-18 22:47:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-11-18 22:47:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-11-18 22:47:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 22:47:41,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:41,786 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:41,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:47:41,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:41,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -69887406, now seen corresponding path program 1 times [2024-11-18 22:47:41,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129422094] [2024-11-18 22:47:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-18 22:47:42,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129422094] [2024-11-18 22:47:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129422094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:47:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432619007] [2024-11-18 22:47:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:42,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:47:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:47:42,088 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 22:47:42,090 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 22:47:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:42,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 22:47:42,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:47:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-18 22:47:42,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:47:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-18 22:47:42,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432619007] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:47:42,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:47:42,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21 [2024-11-18 22:47:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100868677] [2024-11-18 22:47:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:47:42,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 22:47:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 22:47:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-18 22:47:42,771 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-18 22:47:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:43,157 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2024-11-18 22:47:43,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 22:47:43,158 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 93 [2024-11-18 22:47:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:43,159 INFO L225 Difference]: With dead ends: 179 [2024-11-18 22:47:43,159 INFO L226 Difference]: Without dead ends: 112 [2024-11-18 22:47:43,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2024-11-18 22:47:43,160 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 215 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:43,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 342 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:47:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-18 22:47:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-18 22:47:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 22:47:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2024-11-18 22:47:43,168 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 93 [2024-11-18 22:47:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:43,169 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2024-11-18 22:47:43,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) [2024-11-18 22:47:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2024-11-18 22:47:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 22:47:43,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:43,170 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:43,184 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 22:47:43,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:47:43,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:43,376 INFO L85 PathProgramCache]: Analyzing trace with hash 238150162, now seen corresponding path program 1 times [2024-11-18 22:47:43,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644159181] [2024-11-18 22:47:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 22:47:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644159181] [2024-11-18 22:47:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644159181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 22:47:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034921283] [2024-11-18 22:47:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 22:47:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 22:47:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-18 22:47:43,970 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:44,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:44,423 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions. [2024-11-18 22:47:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 22:47:44,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-18 22:47:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:44,426 INFO L225 Difference]: With dead ends: 189 [2024-11-18 22:47:44,426 INFO L226 Difference]: Without dead ends: 187 [2024-11-18 22:47:44,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-18 22:47:44,427 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 206 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:44,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 535 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:47:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-18 22:47:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111. [2024-11-18 22:47:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 22:47:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2024-11-18 22:47:44,436 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 93 [2024-11-18 22:47:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2024-11-18 22:47:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2024-11-18 22:47:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 22:47:44,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:44,438 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:47:44,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 631177172, now seen corresponding path program 1 times [2024-11-18 22:47:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802865782] [2024-11-18 22:47:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-18 22:47:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:47:44,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802865782] [2024-11-18 22:47:44,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802865782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 22:47:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949583554] [2024-11-18 22:47:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:44,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 22:47:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:47:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 22:47:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 22:47:44,859 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:45,175 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2024-11-18 22:47:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:47:45,175 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-11-18 22:47:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:45,176 INFO L225 Difference]: With dead ends: 120 [2024-11-18 22:47:45,177 INFO L226 Difference]: Without dead ends: 118 [2024-11-18 22:47:45,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:47:45,177 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 38 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:47:45,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 499 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:47:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-18 22:47:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-11-18 22:47:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-18 22:47:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-11-18 22:47:45,187 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 93 [2024-11-18 22:47:45,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:45,187 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-11-18 22:47:45,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-18 22:47:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-11-18 22:47:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-18 22:47:45,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:45,188 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:45,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 22:47:45,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:45,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -204748978, now seen corresponding path program 1 times [2024-11-18 22:47:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:47:45,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899861820] [2024-11-18 22:47:45,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:45,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:47:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:47:45,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:47:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:47:45,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:47:45,270 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:47:45,271 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:47:45,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 22:47:45,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:45,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:47:45,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:47:45 BoogieIcfgContainer [2024-11-18 22:47:45,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:47:45,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:47:45,334 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:47:45,334 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:47:45,335 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:37" (3/4) ... [2024-11-18 22:47:45,337 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:47:45,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:47:45,338 INFO L158 Benchmark]: Toolchain (without parser) took 8379.05ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 117.8MB in the beginning and 106.8MB in the end (delta: 11.0MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,338 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 76.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:47:45,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.04ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 103.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.23ms. Allocated memory is still 151.0MB. Free memory was 103.2MB in the beginning and 100.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,339 INFO L158 Benchmark]: Boogie Preprocessor took 66.69ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 96.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,339 INFO L158 Benchmark]: RCFGBuilder took 512.23ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 108.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,340 INFO L158 Benchmark]: TraceAbstraction took 7444.30ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 107.6MB in the beginning and 107.9MB in the end (delta: -310.7kB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,340 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 264.2MB. Free memory was 107.9MB in the beginning and 106.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:47:45,341 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.15ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 76.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.04ms. Allocated memory is still 151.0MB. Free memory was 117.8MB in the beginning and 103.2MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.23ms. Allocated memory is still 151.0MB. Free memory was 103.2MB in the beginning and 100.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.69ms. Allocated memory is still 151.0MB. Free memory was 100.0MB in the beginning and 96.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.23ms. Allocated memory is still 151.0MB. Free memory was 96.7MB in the beginning and 108.7MB in the end (delta: -11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7444.30ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 107.6MB in the beginning and 107.9MB in the end (delta: -310.7kB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 264.2MB. Free memory was 107.9MB in the beginning and 106.8MB in the end (delta: 1.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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] [L19] reach_error() VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 2129 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1623 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 506 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 7 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 905 ConstructedInterpolants, 0 QuantifiedInterpolants, 4150 SizeOfPredicates, 7 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 3006/3120 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 could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:47:45,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:47:47,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:47:47,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:47:47,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:47:47,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:47:47,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:47:47,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:47:47,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:47:47,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:47:47,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:47:47,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:47:47,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:47:47,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:47:47,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:47:47,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:47:47,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:47:47,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:47:47,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:47:47,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:47:47,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:47:47,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:47:47,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:47:47,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:47:47,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:47:47,344 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:47:47,344 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:47:47,345 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:47:47,345 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:47:47,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:47:47,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:47:47,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:47:47,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:47:47,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:47:47,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:47:47,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:47:47,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:47:47,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:47:47,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:47:47,349 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:47:47,349 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:47:47,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:47:47,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:47:47,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:47:47,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:47:47,354 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4 [2024-11-18 22:47:47,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:47:47,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:47:47,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:47:47,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:47:47,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:47:47,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:48,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:47:49,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:47:49,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:49,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3d11dcd/15bd6677f40641949e85a9a2ce3032ed/FLAG94fa27846 [2024-11-18 22:47:49,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3d11dcd/15bd6677f40641949e85a9a2ce3032ed [2024-11-18 22:47:49,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:47:49,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:47:49,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:47:49,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:47:49,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:47:49,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16902999 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49, skipping insertion in model container [2024-11-18 22:47:49,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,117 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:47:49,272 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-11-18 22:47:49,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:47:49,331 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:47:49,353 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2024-11-18 22:47:49,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:47:49,396 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:47:49,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49 WrapperNode [2024-11-18 22:47:49,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:47:49,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:47:49,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:47:49,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:47:49,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,443 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-18 22:47:49,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:47:49,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:47:49,447 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:47:49,447 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:47:49,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:47:49,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:47:49,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:47:49,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:47:49,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:47:49,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (1/1) ... [2024-11-18 22:47:49,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:47:49,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:47:49,543 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 22:47:49,548 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 22:47:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:47:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:47:49,591 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:47:49,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:47:49,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:47:49,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:47:49,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:47:49,677 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:47:49,888 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-18 22:47:49,888 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:47:49,902 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:47:49,903 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:47:49,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:49 BoogieIcfgContainer [2024-11-18 22:47:49,903 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:47:49,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:47:49,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:47:49,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:47:49,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:47:49" (1/3) ... [2024-11-18 22:47:49,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b5d082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:49, skipping insertion in model container [2024-11-18 22:47:49,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:47:49" (2/3) ... [2024-11-18 22:47:49,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b5d082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:47:49, skipping insertion in model container [2024-11-18 22:47:49,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:47:49" (3/3) ... [2024-11-18 22:47:49,913 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2024-11-18 22:47:49,928 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:47:49,929 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:47:49,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:47:50,004 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;@6b6dba06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:47:50,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:47:50,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 22:47:50,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:50,018 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:50,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:50,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash 231096405, now seen corresponding path program 1 times [2024-11-18 22:47:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:47:50,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137494067] [2024-11-18 22:47:50,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:50,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:47:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:47:50,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:47:50,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:47:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:50,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:47:50,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:47:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-18 22:47:50,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:47:50,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:47:50,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137494067] [2024-11-18 22:47:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137494067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:47:50,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:47:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:47:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346777234] [2024-11-18 22:47:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:47:50,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:47:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:47:50,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:47:50,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:47:50,251 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 22:47:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:47:50,273 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2024-11-18 22:47:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:47:50,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2024-11-18 22:47:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:47:50,282 INFO L225 Difference]: With dead ends: 87 [2024-11-18 22:47:50,283 INFO L226 Difference]: Without dead ends: 41 [2024-11-18 22:47:50,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-18 22:47:50,288 INFO L432 NwaCegarLoop]: 61 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, 61 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-18 22:47:50,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:47:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-18 22:47:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-18 22:47:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-18 22:47:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-11-18 22:47:50,323 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 86 [2024-11-18 22:47:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:47:50,324 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-11-18 22:47:50,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-18 22:47:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-11-18 22:47:50,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 22:47:50,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:47:50,330 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:47:50,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 22:47:50,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:47:50,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:47:50,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:47:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -479824553, now seen corresponding path program 1 times [2024-11-18 22:47:50,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:47:50,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781463737] [2024-11-18 22:47:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:47:50,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:47:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:47:50,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:47:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:47:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:47:50,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 22:47:50,642 INFO L278 TraceCheckSpWp]: Computing forward predicates...