./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.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 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:47:30,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:47:30,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:47:30,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:47:30,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:47:30,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:47:30,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:47:30,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:47:30,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:47:30,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:47:30,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:47:30,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:47:30,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:47:30,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:47:30,848 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:47:30,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:47:30,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:47:30,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:47:30,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:47:30,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:47:30,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:47:30,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:47:30,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:47:30,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:47:30,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:47:30,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:47:30,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:47:30,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:47:30,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:47:30,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:47:30,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:47:30,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:47:30,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:30,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:47:30,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:47:30,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:47:30,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:47:30,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:47:30,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:47:30,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:47:30,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:47:30,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:47:30,859 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 -> 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a [2024-11-20 06:47:31,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:47:31,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:47:31,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:47:31,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:47:31,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:47:31,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:32,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:47:32,773 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:47:32,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:32,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5524b369f/eb3894269413443e9e7e7a393f9c1608/FLAG5ce721550 [2024-11-20 06:47:33,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5524b369f/eb3894269413443e9e7e7a393f9c1608 [2024-11-20 06:47:33,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:47:33,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:47:33,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:33,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:47:33,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:47:33,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e202b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33, skipping insertion in model container [2024-11-20 06:47:33,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:47:33,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i[915,928] [2024-11-20 06:47:33,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:33,361 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:47:33,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i[915,928] [2024-11-20 06:47:33,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:33,410 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:47:33,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33 WrapperNode [2024-11-20 06:47:33,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:33,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:33,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:47:33,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:47:33,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,473 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2024-11-20 06:47:33,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:33,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:47:33,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:47:33,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:47:33,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,503 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-20 06:47:33,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:47:33,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:47:33,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:47:33,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:47:33,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (1/1) ... [2024-11-20 06:47:33,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:33,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:47:33,569 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-20 06:47:33,575 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-20 06:47:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:47:33,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:47:33,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:47:33,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:47:33,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:47:33,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:47:33,705 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:47:33,707 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:47:34,007 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-20 06:47:34,008 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:47:34,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:47:34,025 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:47:34,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:34 BoogieIcfgContainer [2024-11-20 06:47:34,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:47:34,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:47:34,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:47:34,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:47:34,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:47:33" (1/3) ... [2024-11-20 06:47:34,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac91215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:34, skipping insertion in model container [2024-11-20 06:47:34,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:33" (2/3) ... [2024-11-20 06:47:34,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac91215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:34, skipping insertion in model container [2024-11-20 06:47:34,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:34" (3/3) ... [2024-11-20 06:47:34,036 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:34,049 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:47:34,050 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:47:34,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:47:34,106 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;@39127532, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:47:34,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:47:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 06:47:34,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:34,119 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:34,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:34,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash -531792171, now seen corresponding path program 1 times [2024-11-20 06:47:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:34,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267664000] [2024-11-20 06:47:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:47:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:47:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:47:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:47:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:47:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:47:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:47:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:47:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:47:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:47:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:47:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:47:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:47:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:47:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267664000] [2024-11-20 06:47:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267664000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:47:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:47:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:47:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302346130] [2024-11-20 06:47:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:34,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:47:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:47:34,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:47:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:47:34,587 INFO L87 Difference]: Start difference. First operand has 54 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:34,608 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2024-11-20 06:47:34,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:47:34,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-20 06:47:34,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:34,616 INFO L225 Difference]: With dead ends: 99 [2024-11-20 06:47:34,617 INFO L226 Difference]: Without dead ends: 48 [2024-11-20 06:47:34,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-20 06:47:34,623 INFO L432 NwaCegarLoop]: 67 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, 67 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-20 06:47:34,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:47:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-20 06:47:34,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-20 06:47:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2024-11-20 06:47:34,660 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 82 [2024-11-20 06:47:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:34,661 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2024-11-20 06:47:34,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2024-11-20 06:47:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 06:47:34,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:34,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:34,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:47:34,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:34,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:34,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1140243371, now seen corresponding path program 1 times [2024-11-20 06:47:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594794507] [2024-11-20 06:47:34,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:47:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:47:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:47:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:47:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:47:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:47:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:47:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:47:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:47:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:47:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:47:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:47:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:47:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:47:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594794507] [2024-11-20 06:47:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594794507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:47:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:47:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:47:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231245839] [2024-11-20 06:47:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:47:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:47:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:47:35,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:47:35,491 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:47:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:35,807 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2024-11-20 06:47:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:47:35,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-11-20 06:47:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:35,812 INFO L225 Difference]: With dead ends: 153 [2024-11-20 06:47:35,814 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 06:47:35,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:47:35,816 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 137 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:47:35,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 196 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:47:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 06:47:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 78. [2024-11-20 06:47:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:47:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-20 06:47:35,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 82 [2024-11-20 06:47:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:35,846 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-20 06:47:35,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:47:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-20 06:47:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 06:47:35,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:35,860 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:47:35,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -385616337, now seen corresponding path program 1 times [2024-11-20 06:47:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484715984] [2024-11-20 06:47:35,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:47:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1010883488] [2024-11-20 06:47:35,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:35,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:47:35,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:47:35,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:47:35,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:47:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:36,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 06:47:36,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:47:36,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:47:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-20 06:47:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:47:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484715984] [2024-11-20 06:47:36,577 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 06:47:36,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010883488] [2024-11-20 06:47:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010883488] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 06:47:36,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 06:47:36,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 06:47:36,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167604912] [2024-11-20 06:47:36,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:36,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:47:36,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:47:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:47:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 06:47:36,580 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:47:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:36,880 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2024-11-20 06:47:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:47:36,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-20 06:47:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:36,887 INFO L225 Difference]: With dead ends: 147 [2024-11-20 06:47:36,888 INFO L226 Difference]: Without dead ends: 88 [2024-11-20 06:47:36,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:47:36,889 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:47:36,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:47:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-20 06:47:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2024-11-20 06:47:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 06:47:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 110 transitions. [2024-11-20 06:47:36,905 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 110 transitions. Word has length 83 [2024-11-20 06:47:36,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:36,906 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 110 transitions. [2024-11-20 06:47:36,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-20 06:47:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 110 transitions. [2024-11-20 06:47:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-20 06:47:36,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:36,908 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:36,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:37,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:47:37,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:37,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1389391025, now seen corresponding path program 1 times [2024-11-20 06:47:37,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:47:37,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057860851] [2024-11-20 06:47:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:47:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:47:37,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862335801] [2024-11-20 06:47:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:37,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:47:37,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:47:37,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:47:37,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:47:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:47:37,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:47:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:47:37,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:47:37,296 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:47:37,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:47:37,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:37,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-20 06:47:37,502 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 06:47:37,572 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:47:37,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:47:37 BoogieIcfgContainer [2024-11-20 06:47:37,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:47:37,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:47:37,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:47:37,579 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:47:37,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:34" (3/4) ... [2024-11-20 06:47:37,583 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:47:37,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:47:37,585 INFO L158 Benchmark]: Toolchain (without parser) took 4447.57ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 106.5MB in the beginning and 109.8MB in the end (delta: -3.3MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,585 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:47:37,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.92ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 92.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.57ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 88.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,589 INFO L158 Benchmark]: Boogie Preprocessor took 51.93ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 85.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,589 INFO L158 Benchmark]: RCFGBuilder took 498.70ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 65.8MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,590 INFO L158 Benchmark]: TraceAbstraction took 3549.44ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 65.2MB in the beginning and 109.8MB in the end (delta: -44.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-20 06:47:37,590 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 230.7MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:47:37,591 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.19ms. Allocated memory is still 163.6MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.92ms. Allocated memory is still 163.6MB. Free memory was 106.5MB in the beginning and 92.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.57ms. Allocated memory is still 163.6MB. Free memory was 92.4MB in the beginning and 88.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.93ms. Allocated memory is still 163.6MB. Free memory was 88.8MB in the beginning and 85.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.70ms. Allocated memory is still 163.6MB. Free memory was 85.5MB in the beginning and 65.8MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3549.44ms. Allocated memory was 163.6MB in the beginning and 230.7MB in the end (delta: 67.1MB). Free memory was 65.2MB in the beginning and 109.8MB in the end (delta: -44.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 230.7MB. Free memory is still 109.8MB. 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 82, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_3 = 2941876006; [L24] double var_1_5 = 127.422; [L25] unsigned short int var_1_6 = 10; [L26] unsigned char var_1_7 = 1; [L27] unsigned long int var_1_9 = 4; [L28] unsigned short int var_1_11 = 44699; [L29] signed short int var_1_13 = 2; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 16; [L32] float var_1_17 = 8.125; VAL [isInitial=0, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2941876006, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L61] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L63] var_1_5 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L64] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=1, var_1_9=4] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L66] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=4] [L68] var_1_9 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L69] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L70] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0] [L71] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L71] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L72] var_1_11 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L73] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L75] var_1_16 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=2147483647, var_1_6=10, var_1_7=0, var_1_9=1] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] EXPR var_1_15 & var_1_15 VAL [isInitial=1, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] unsigned long int stepLocal_2 = var_1_3 * (var_1_15 & var_1_15); [L39] COND FALSE !(\read(var_1_7)) [L46] var_1_6 = (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1) VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L48] var_1_13 = var_1_15 [L49] signed long int stepLocal_1 = var_1_6 * var_1_15; [L50] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L51] COND TRUE stepLocal_0 <= (var_1_3 - var_1_6) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L52] COND FALSE !(var_1_3 < stepLocal_1) [L55] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_2=0, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L91] RET step() [L92] CALL, EXPR property() [L82] EXPR ((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1)))) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L82-L83] return (((((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1))))) && (var_1_13 == ((signed short int) var_1_15))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((float) var_1_5)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=32767, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=2147483647, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 204 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 326 ConstructedInterpolants, 3 QuantifiedInterpolants, 800 SizeOfPredicates, 4 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1023/1056 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-20 06:47:37,618 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.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 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:47:39,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:47:39,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:47:39,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:47:39,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:47:39,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:47:39,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:47:39,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:47:39,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:47:39,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:47:39,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:47:39,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:47:39,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:47:39,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:47:39,925 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:47:39,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:47:39,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:47:39,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:47:39,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:47:39,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:47:39,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:47:39,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:47:39,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:47:39,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:47:39,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:47:39,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:47:39,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:47:39,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:47:39,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:47:39,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:47:39,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:47:39,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:47:39,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:47:39,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:47:39,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:39,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:47:39,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:47:39,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:47:39,933 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:47:39,933 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:47:39,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:47:39,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:47:39,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:47:39,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:47:39,936 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 -> 5cfd8244917467985e1ec9aab123eb53d7984fa345597a11e6475c4a60dfdb5a [2024-11-20 06:47:40,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:47:40,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:47:40,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:47:40,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:47:40,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:47:40,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:41,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:47:42,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:47:42,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:42,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d672324ba/158da7412e4e4016bec6a5557040159b/FLAG85edc2117 [2024-11-20 06:47:42,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d672324ba/158da7412e4e4016bec6a5557040159b [2024-11-20 06:47:42,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:47:42,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:47:42,447 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:42,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:47:42,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:47:42,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6593432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42, skipping insertion in model container [2024-11-20 06:47:42,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:47:42,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i[915,928] [2024-11-20 06:47:42,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:42,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:47:42,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-64.i[915,928] [2024-11-20 06:47:42,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:47:42,798 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:47:42,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42 WrapperNode [2024-11-20 06:47:42,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:47:42,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:42,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:47:42,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:47:42,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,852 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-11-20 06:47:42,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:47:42,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:47:42,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:47:42,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:47:42,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,881 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-20 06:47:42,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:47:42,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:47:42,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:47:42,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:47:42,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (1/1) ... [2024-11-20 06:47:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:47:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:47:42,954 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-20 06:47:42,961 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-20 06:47:43,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:47:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:47:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:47:43,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:47:43,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:47:43,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:47:43,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:47:43,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:47:43,535 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 06:47:43,535 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:47:43,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:47:43,546 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:47:43,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:43 BoogieIcfgContainer [2024-11-20 06:47:43,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:47:43,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:47:43,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:47:43,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:47:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:47:42" (1/3) ... [2024-11-20 06:47:43,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f6136d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:43, skipping insertion in model container [2024-11-20 06:47:43,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:47:42" (2/3) ... [2024-11-20 06:47:43,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f6136d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:47:43, skipping insertion in model container [2024-11-20 06:47:43,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:47:43" (3/3) ... [2024-11-20 06:47:43,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-64.i [2024-11-20 06:47:43,571 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:47:43,571 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:47:43,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:47:43,629 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;@69279ec3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:47:43,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:47:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:47:43,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:43,645 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:43,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:43,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1855080281, now seen corresponding path program 1 times [2024-11-20 06:47:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:47:43,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424896323] [2024-11-20 06:47:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:43,670 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-20 06:47:43,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:47:43,674 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-20 06:47:43,675 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-20 06:47:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:43,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:47:43,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-20 06:47:43,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:47:43,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:47:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424896323] [2024-11-20 06:47:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424896323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:47:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:47:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:47:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076540368] [2024-11-20 06:47:43,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:47:43,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:47:43,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:47:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:47:43,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:47:43,986 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:44,016 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2024-11-20 06:47:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:47:44,020 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-20 06:47:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:44,027 INFO L225 Difference]: With dead ends: 77 [2024-11-20 06:47:44,028 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 06:47:44,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-20 06:47:44,037 INFO L432 NwaCegarLoop]: 53 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, 53 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-20 06:47:44,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:47:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 06:47:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 06:47:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-20 06:47:44,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 78 [2024-11-20 06:47:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:44,087 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-20 06:47:44,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-20 06:47:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 06:47:44,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:44,092 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:44,101 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:44,292 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-20 06:47:44,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1041026265, now seen corresponding path program 1 times [2024-11-20 06:47:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:47:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653341392] [2024-11-20 06:47:44,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:44,295 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-20 06:47:44,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:47:44,297 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-20 06:47:44,299 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-20 06:47:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:44,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:47:44,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:47:44,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:47:44,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:47:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653341392] [2024-11-20 06:47:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653341392] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:47:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [76334104] [2024-11-20 06:47:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:44,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:47:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:47:44,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:47:44,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-20 06:47:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:45,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:47:45,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:47:45,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:47:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [76334104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:47:45,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:47:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-20 06:47:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543875635] [2024-11-20 06:47:45,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:47:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:47:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:47:45,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:47:45,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:47:45,587 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:46,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:46,471 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2024-11-20 06:47:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:47:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-11-20 06:47:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:46,482 INFO L225 Difference]: With dead ends: 90 [2024-11-20 06:47:46,482 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 06:47:46,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:47:46,484 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:47:46,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:47:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 06:47:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2024-11-20 06:47:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2024-11-20 06:47:46,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 78 [2024-11-20 06:47:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:46,497 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2024-11-20 06:47:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2024-11-20 06:47:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 06:47:46,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:46,500 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:46,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-20 06:47:46,707 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:46,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-20 06:47:46,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:46,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1971482828, now seen corresponding path program 1 times [2024-11-20 06:47:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:47:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60485975] [2024-11-20 06:47:46,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:46,904 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-20 06:47:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:47:46,907 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-20 06:47:46,909 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-20 06:47:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:47,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:47:47,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:47:47,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:47:47,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:47:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60485975] [2024-11-20 06:47:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60485975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:47:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [333968291] [2024-11-20 06:47:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:47:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:47:47,498 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:47:47,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 06:47:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:47,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:47:47,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:47:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 06:47:48,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:47:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [333968291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:47:48,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 06:47:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-20 06:47:48,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7206935] [2024-11-20 06:47:48,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 06:47:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:47:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:47:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:47:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:47:48,184 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:47:49,462 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2024-11-20 06:47:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 06:47:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-11-20 06:47:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:47:49,472 INFO L225 Difference]: With dead ends: 83 [2024-11-20 06:47:49,472 INFO L226 Difference]: Without dead ends: 44 [2024-11-20 06:47:49,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:47:49,474 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:47:49,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 06:47:49,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-20 06:47:49,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-20 06:47:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-20 06:47:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-11-20 06:47:49,487 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 79 [2024-11-20 06:47:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:47:49,487 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-20 06:47:49,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 06:47:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-11-20 06:47:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 06:47:49,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:47:49,489 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:47:49,498 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 (5)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:49,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-20 06:47:49,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 06:47:49,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:47:49,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:47:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1973329870, now seen corresponding path program 1 times [2024-11-20 06:47:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:47:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361212812] [2024-11-20 06:47:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:47:49,892 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-20 06:47:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:47:49,894 INFO L229 MonitoredProcess]: Starting monitored process 7 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-20 06:47:49,895 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 (7)] Waiting until timeout for monitored process [2024-11-20 06:47:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:47:50,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 06:47:50,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:48:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-20 06:48:11,117 INFO L311 TraceCheckSpWp]: Computing backward predicates...