./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_codestructure_dependencies_file-48.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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:10:01,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:10:01,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:10:01,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:10:01,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:10:01,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:10:01,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:10:01,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:10:01,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:10:01,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:10:01,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:10:01,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:10:01,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:10:01,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:10:01,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:10:01,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:10:01,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:10:01,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:10:01,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:10:01,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:10:01,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:10:01,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:10:01,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:10:01,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:10:01,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:10:01,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:10:01,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:10:01,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:10:01,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:10:01,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:10:01,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:10:01,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:10:01,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:10:01,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:10:01,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:10:01,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:10:01,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:10:01,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:10:01,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:10:01,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:10:01,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:10:01,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:10:01,749 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-11-10 03:10:02,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:10:02,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:10:02,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:10:02,032 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:10:02,033 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:10:02,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:03,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:10:03,766 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:10:03,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:03,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35120e79/2ba666c6a0b14bdb9824774284bc4027/FLAGbe9fe554d [2024-11-10 03:10:03,794 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f35120e79/2ba666c6a0b14bdb9824774284bc4027 [2024-11-10 03:10:03,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:10:03,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:10:03,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:10:03,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:10:03,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:10:03,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:10:03" (1/1) ... [2024-11-10 03:10:03,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6bdbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:03, skipping insertion in model container [2024-11-10 03:10:03,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:10:03" (1/1) ... [2024-11-10 03:10:03,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:10:04,020 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_codestructure_dependencies_file-48.i[919,932] [2024-11-10 03:10:04,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:10:04,136 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:10:04,149 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_codestructure_dependencies_file-48.i[919,932] [2024-11-10 03:10:04,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:10:04,196 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:10:04,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04 WrapperNode [2024-11-10 03:10:04,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:10:04,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:10:04,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:10:04,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:10:04,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,253 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-10 03:10:04,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:10:04,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:10:04,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:10:04,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:10:04,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,294 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-10 03:10:04,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,305 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:10:04,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:10:04,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:10:04,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:10:04,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (1/1) ... [2024-11-10 03:10:04,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:10:04,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:10:04,366 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-10 03:10:04,369 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-10 03:10:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:10:04,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:10:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:10:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:10:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:10:04,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:10:04,507 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:10:04,510 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:10:04,825 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:10:04,825 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:10:04,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:10:04,840 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:10:04,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:10:04 BoogieIcfgContainer [2024-11-10 03:10:04,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:10:04,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:10:04,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:10:04,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:10:04,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:10:03" (1/3) ... [2024-11-10 03:10:04,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333680fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:10:04, skipping insertion in model container [2024-11-10 03:10:04,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:04" (2/3) ... [2024-11-10 03:10:04,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333680fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:10:04, skipping insertion in model container [2024-11-10 03:10:04,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:10:04" (3/3) ... [2024-11-10 03:10:04,849 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:04,861 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:10:04,862 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:10:04,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:10:04,926 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;@1f35265a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:10:04,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:10:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:04,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:04,949 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:04,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:04,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -771048510, now seen corresponding path program 1 times [2024-11-10 03:10:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:10:04,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926172873] [2024-11-10 03:10:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:10:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:10:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:10:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:10:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:10:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:10:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:10:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:10:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:10:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:10:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:10:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:10:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:10:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:10:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:10:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 03:10:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:10:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:10:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:10:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:10:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:10:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 03:10:05,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:10:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926172873] [2024-11-10 03:10:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926172873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:10:05,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780793944] [2024-11-10 03:10:05,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:05,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:10:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:10:05,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:10:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:10:05,427 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 03:10:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:10:05,459 INFO L93 Difference]: Finished difference Result 123 states and 211 transitions. [2024-11-10 03:10:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:10:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-10 03:10:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:10:05,472 INFO L225 Difference]: With dead ends: 123 [2024-11-10 03:10:05,472 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 03:10:05,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10 03:10:05,480 INFO L432 NwaCegarLoop]: 89 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, 89 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-10 03:10:05,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:10:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 03:10:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 03:10:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-10 03:10:05,542 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-10 03:10:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:10:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-10 03:10:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 03:10:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-10 03:10:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:05,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:05,553 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:05,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:10:05,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:05,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1660319166, now seen corresponding path program 1 times [2024-11-10 03:10:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:10:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099795546] [2024-11-10 03:10:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:10:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:10:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:10:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:10:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:10:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:10:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:10:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:10:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:10:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:10:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:10:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:10:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:10:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:10:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:10:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 03:10:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:10:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:10:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:10:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:10:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:10:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 03:10:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:10:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099795546] [2024-11-10 03:10:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099795546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:10:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715000183] [2024-11-10 03:10:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:10:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:10:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:10:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:05,967 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:10:06,027 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2024-11-10 03:10:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:10:06,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-10 03:10:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:10:06,031 INFO L225 Difference]: With dead ends: 135 [2024-11-10 03:10:06,034 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 03:10:06,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:06,036 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:10:06,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:10:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 03:10:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2024-11-10 03:10:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-11-10 03:10:06,053 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 129 [2024-11-10 03:10:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:10:06,057 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-11-10 03:10:06,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-11-10 03:10:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:06,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:06,059 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:06,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:10:06,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1747144449, now seen corresponding path program 1 times [2024-11-10 03:10:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:10:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846397554] [2024-11-10 03:10:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:10:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:10:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:10:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:10:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:10:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 03:10:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 03:10:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 03:10:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 03:10:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 03:10:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:10:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:10:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 03:10:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 03:10:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 03:10:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 03:10:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 03:10:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 03:10:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:10:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 03:10:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:10:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 03:10:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:10:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846397554] [2024-11-10 03:10:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846397554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:06,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:06,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:10:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881460928] [2024-11-10 03:10:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:06,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:10:06,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:10:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:10:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:06,395 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:06,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:10:06,448 INFO L93 Difference]: Finished difference Result 189 states and 285 transitions. [2024-11-10 03:10:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:10:06,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-10 03:10:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:10:06,452 INFO L225 Difference]: With dead ends: 189 [2024-11-10 03:10:06,452 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 03:10:06,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:06,454 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:10:06,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:10:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 03:10:06,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-10 03:10:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 03:10:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2024-11-10 03:10:06,483 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 129 [2024-11-10 03:10:06,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:10:06,483 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2024-11-10 03:10:06,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2024-11-10 03:10:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 03:10:06,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:06,486 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:06,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:10:06,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1932072265, now seen corresponding path program 1 times [2024-11-10 03:10:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:10:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582522086] [2024-11-10 03:10:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:06,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:10:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:10:06,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:10:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:10:06,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:10:06,791 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:10:06,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:10:06,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:10:06,798 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:10:06,938 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:10:06,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:10:06 BoogieIcfgContainer [2024-11-10 03:10:06,944 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:10:06,944 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:10:06,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:10:06,945 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:10:06,945 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:10:04" (3/4) ... [2024-11-10 03:10:06,948 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:10:06,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:10:06,949 INFO L158 Benchmark]: Toolchain (without parser) took 3150.95ms. Allocated memory is still 186.6MB. Free memory was 118.5MB in the beginning and 151.5MB in the end (delta: -32.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:10:06,950 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:10:06,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.62ms. Allocated memory is still 186.6MB. Free memory was 118.4MB in the beginning and 155.1MB in the end (delta: -36.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-10 03:10:06,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.99ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 151.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:10:06,954 INFO L158 Benchmark]: Boogie Preprocessor took 60.21ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 147.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:10:06,954 INFO L158 Benchmark]: IcfgBuilder took 524.95ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 126.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 03:10:06,955 INFO L158 Benchmark]: TraceAbstraction took 2101.73ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 151.5MB in the end (delta: -25.8MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2024-11-10 03:10:06,955 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 186.6MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:10:06,957 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.24ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.62ms. Allocated memory is still 186.6MB. Free memory was 118.4MB in the beginning and 155.1MB in the end (delta: -36.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.99ms. Allocated memory is still 186.6MB. Free memory was 155.1MB in the beginning and 151.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.21ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 147.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 524.95ms. Allocated memory is still 186.6MB. Free memory was 147.6MB in the beginning and 126.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2101.73ms. Allocated memory is still 186.6MB. Free memory was 125.7MB in the beginning and 151.5MB in the end (delta: -25.8MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 186.6MB. Free memory is still 151.5MB. There was no memory consumed. 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 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L131] last_1_var_1_8 = var_1_8 [L132] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L142] RET updateLastVariables() [L143] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] var_1_3 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L111] var_1_9 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L112] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L113] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] var_1_11 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] var_1_15 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] var_1_16 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] var_1_17 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L143] RET updateVariables() [L144] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L54] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L56] COND TRUE var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12))) [L57] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L70] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L71] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L79] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L82] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L85] COND FALSE !(last_1_var_1_18 != var_1_16) [L92] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=4, var_1_15=255, var_1_16=64, var_1_17=-4, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 423 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 264 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 384 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 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-10 03:10:06,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_codestructure_dependencies_file-48.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 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:10:09,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:10:09,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:10:09,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:10:09,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:10:09,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:10:09,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:10:09,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:10:09,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:10:09,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:10:09,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:10:09,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:10:09,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:10:09,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:10:09,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:10:09,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:10:09,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:10:09,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:10:09,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:10:09,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:10:09,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:10:09,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:10:09,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:10:09,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:10:09,391 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:10:09,391 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:10:09,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:10:09,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:10:09,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:10:09,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:10:09,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:10:09,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:10:09,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:10:09,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:10:09,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:10:09,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:10:09,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:10:09,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:10:09,396 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:10:09,396 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:10:09,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:10:09,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:10:09,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:10:09,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:10:09,398 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 -> 155661f7f785ccb94a94941deccc723470e31568c938f67b1f43e70ee84fa5f7 [2024-11-10 03:10:09,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:10:09,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:10:09,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:10:09,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:10:09,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:10:09,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:11,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:10:11,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:10:11,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:11,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382c78525/cac6a8d2498848288bda85db41709407/FLAG8bade1434 [2024-11-10 03:10:11,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/382c78525/cac6a8d2498848288bda85db41709407 [2024-11-10 03:10:11,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:10:11,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:10:11,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:10:11,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:10:11,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:10:11,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:10:11" (1/1) ... [2024-11-10 03:10:11,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f990131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:11, skipping insertion in model container [2024-11-10 03:10:11,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:10:11" (1/1) ... [2024-11-10 03:10:12,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:10:12,235 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_codestructure_dependencies_file-48.i[919,932] [2024-11-10 03:10:12,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:10:12,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:10:12,346 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_codestructure_dependencies_file-48.i[919,932] [2024-11-10 03:10:12,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:10:12,409 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:10:12,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12 WrapperNode [2024-11-10 03:10:12,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:10:12,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:10:12,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:10:12,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:10:12,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,471 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-10 03:10:12,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:10:12,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:10:12,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:10:12,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:10:12,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,515 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-10 03:10:12,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,535 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:10:12,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:10:12,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:10:12,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:10:12,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (1/1) ... [2024-11-10 03:10:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:10:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:10:12,592 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-10 03:10:12,596 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-10 03:10:12,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:10:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:10:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:10:12,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:10:12,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:10:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:10:12,756 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:10:12,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:10:36,944 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:10:36,944 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:10:36,959 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:10:36,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:10:36,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:10:36 BoogieIcfgContainer [2024-11-10 03:10:36,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:10:36,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:10:36,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:10:36,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:10:36,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:10:11" (1/3) ... [2024-11-10 03:10:36,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23875001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:10:36, skipping insertion in model container [2024-11-10 03:10:36,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:10:12" (2/3) ... [2024-11-10 03:10:36,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23875001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:10:36, skipping insertion in model container [2024-11-10 03:10:36,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:10:36" (3/3) ... [2024-11-10 03:10:36,971 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-48.i [2024-11-10 03:10:36,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:10:36,991 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:10:37,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:10:37,053 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;@76306403, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:10:37,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:10:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:37,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:37,072 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:37,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:37,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -771048510, now seen corresponding path program 1 times [2024-11-10 03:10:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:10:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190034050] [2024-11-10 03:10:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:37,093 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-10 03:10:37,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:10:37,096 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-10 03:10:37,097 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-10 03:10:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:38,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:10:38,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:10:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 03:10:38,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:10:38,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:10:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190034050] [2024-11-10 03:10:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190034050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:38,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:10:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545101967] [2024-11-10 03:10:38,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:38,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:10:38,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:10:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:10:38,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:10:38,581 INFO L87 Difference]: Start difference. First operand has 66 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 03:10:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:10:38,605 INFO L93 Difference]: Finished difference Result 123 states and 211 transitions. [2024-11-10 03:10:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:10:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-10 03:10:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:10:38,613 INFO L225 Difference]: With dead ends: 123 [2024-11-10 03:10:38,613 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 03:10:38,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-10 03:10:38,619 INFO L432 NwaCegarLoop]: 89 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, 89 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-10 03:10:38,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:10:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 03:10:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 03:10:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2024-11-10 03:10:38,656 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2024-11-10 03:10:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:10:38,657 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2024-11-10 03:10:38,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-10 03:10:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2024-11-10 03:10:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:38,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:38,666 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:38,702 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-10 03:10:38,866 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-10 03:10:38,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1660319166, now seen corresponding path program 1 times [2024-11-10 03:10:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:10:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871446626] [2024-11-10 03:10:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:38,870 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-10 03:10:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:10:38,874 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-10 03:10:38,875 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-10 03:10:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:40,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 03:10:40,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:10:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 03:10:40,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:10:40,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:10:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871446626] [2024-11-10 03:10:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871446626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:10:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231988207] [2024-11-10 03:10:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:40,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:10:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:10:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:10:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:40,456 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:45,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:10:49,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:10:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:10:49,806 INFO L93 Difference]: Finished difference Result 135 states and 201 transitions. [2024-11-10 03:10:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:10:49,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-10 03:10:49,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:10:49,810 INFO L225 Difference]: With dead ends: 135 [2024-11-10 03:10:49,810 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 03:10:49,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:49,812 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:10:49,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 168 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-10 03:10:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 03:10:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2024-11-10 03:10:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 03:10:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-11-10 03:10:49,825 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 129 [2024-11-10 03:10:49,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:10:49,826 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-11-10 03:10:49,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:10:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-11-10 03:10:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-10 03:10:49,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:10:49,829 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:10:49,866 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 (3)] Ended with exit code 0 [2024-11-10 03:10:50,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10 03:10:50,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:10:50,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:10:50,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1747144449, now seen corresponding path program 1 times [2024-11-10 03:10:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:10:50,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106107018] [2024-11-10 03:10:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:10:50,032 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-10 03:10:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:10:50,034 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10 03:10:50,035 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 (4)] Waiting until timeout for monitored process [2024-11-10 03:10:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:10:51,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 03:10:51,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:10:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-10 03:10:56,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:10:56,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:10:56,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106107018] [2024-11-10 03:10:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106107018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:10:56,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:10:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:10:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326661259] [2024-11-10 03:10:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:10:56,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:10:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:10:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:10:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:10:56,917 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:11:01,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:11:06,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:11:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:11:06,281 INFO L93 Difference]: Finished difference Result 189 states and 285 transitions. [2024-11-10 03:11:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:11:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-10 03:11:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:11:06,288 INFO L225 Difference]: With dead ends: 189 [2024-11-10 03:11:06,288 INFO L226 Difference]: Without dead ends: 127 [2024-11-10 03:11:06,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:11:06,290 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:11:06,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-10 03:11:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-10 03:11:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-10 03:11:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 03:11:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2024-11-10 03:11:06,326 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 129 [2024-11-10 03:11:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:11:06,327 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2024-11-10 03:11:06,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-10 03:11:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2024-11-10 03:11:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-10 03:11:06,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:11:06,333 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:11:06,388 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:11:06,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10 03:11:06,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:11:06,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:11:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1932072265, now seen corresponding path program 1 times [2024-11-10 03:11:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:11:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107314002] [2024-11-10 03:11:06,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:11:06,536 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-10 03:11:06,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:11:06,539 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10 03:11:06,540 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 (5)] Waiting until timeout for monitored process [2024-11-10 03:11:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:11:08,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 03:11:08,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:11:24,757 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 03:11:33,355 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)