./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.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 4b73443b934cb8f13c6c3c0966f6912c28ac30fc0ad18f5f644522c4d2e3ecf6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:59:22,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:59:22,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:59:22,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:59:22,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:59:22,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:59:22,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:59:22,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:59:22,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:59:22,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:59:22,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:59:22,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:59:22,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:59:22,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:59:22,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:59:22,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:59:22,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:59:22,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:59:22,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:59:22,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:59:22,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:59:22,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:59:22,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:59:22,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:59:22,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:59:22,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:59:22,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:59:22,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:59:22,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:59:22,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:59:22,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:59:22,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:59:22,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:59:22,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:59:22,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:59:22,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:59:22,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:59:22,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:59:22,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:59:22,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:59:22,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:59:22,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:59:22,869 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 -> 4b73443b934cb8f13c6c3c0966f6912c28ac30fc0ad18f5f644522c4d2e3ecf6 [2024-11-08 23:59:23,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:59:23,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:59:23,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:59:23,098 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:59:23,098 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:59:23,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:24,312 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:59:24,477 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:59:24,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:24,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8062fcd40/d34c50df91b64a81bdb3bf4f559ab66f/FLAG3eb8f5344 [2024-11-08 23:59:24,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8062fcd40/d34c50df91b64a81bdb3bf4f559ab66f [2024-11-08 23:59:24,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:59:24,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:59:24,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:24,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:59:24,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:59:24,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:24" (1/1) ... [2024-11-08 23:59:24,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8370941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:24, skipping insertion in model container [2024-11-08 23:59:24,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:24" (1/1) ... [2024-11-08 23:59:24,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:59:25,056 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_50-1loop_file-11.i[915,928] [2024-11-08 23:59:25,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:25,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:59:25,147 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_50-1loop_file-11.i[915,928] [2024-11-08 23:59:25,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:25,191 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:59:25,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25 WrapperNode [2024-11-08 23:59:25,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:25,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:25,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:59:25,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:59:25,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,233 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-08 23:59:25,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:25,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:59:25,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:59:25,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:59:25,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,257 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-08 23:59:25,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:59:25,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:59:25,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:59:25,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:59:25,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (1/1) ... [2024-11-08 23:59:25,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:59:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:59:25,310 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-08 23:59:25,312 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-08 23:59:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:59:25,352 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:59:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:59:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:59:25,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:59:25,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:59:25,425 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:59:25,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:59:25,682 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 23:59:25,682 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:59:25,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:59:25,697 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:59:25,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:25 BoogieIcfgContainer [2024-11-08 23:59:25,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:59:25,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:59:25,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:59:25,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:59:25,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:59:24" (1/3) ... [2024-11-08 23:59:25,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6da03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:59:25, skipping insertion in model container [2024-11-08 23:59:25,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:25" (2/3) ... [2024-11-08 23:59:25,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6da03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:59:25, skipping insertion in model container [2024-11-08 23:59:25,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:25" (3/3) ... [2024-11-08 23:59:25,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:25,725 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:59:25,725 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:59:25,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:59:25,797 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;@4781e891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:59:25,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:59:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:59:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:59:25,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:25,816 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:25,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:25,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 149126682, now seen corresponding path program 1 times [2024-11-08 23:59:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:59:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346496555] [2024-11-08 23:59:25,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:59:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:59:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:59:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:59:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:59:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:59:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:59:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:59:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:59:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:59:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:59:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:59:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:59:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:59:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:59:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:59:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:59:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:26,177 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:59:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:59:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346496555] [2024-11-08 23:59:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346496555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:59:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498716064] [2024-11-08 23:59:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:26,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:59:26,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:59:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:59:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:59:26,208 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:59:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:26,231 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-08 23:59:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:59:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-08 23:59:26,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:26,252 INFO L225 Difference]: With dead ends: 113 [2024-11-08 23:59:26,257 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 23:59:26,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-08 23:59:26,267 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:26,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:59:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 23:59:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 23:59:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:59:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-08 23:59:26,340 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 110 [2024-11-08 23:59:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:26,340 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-08 23:59:26,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:59:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-08 23:59:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:59:26,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:26,344 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:59:26,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:26,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:26,345 INFO L85 PathProgramCache]: Analyzing trace with hash -12693410, now seen corresponding path program 1 times [2024-11-08 23:59:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:59:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572483993] [2024-11-08 23:59:26,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:59:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:59:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:59:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:59:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:59:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:59:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:59:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:59:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:59:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:59:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:59:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:59:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:59:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:59:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:59:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:59:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:59:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:59:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:59:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572483993] [2024-11-08 23:59:27,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572483993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:27,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:27,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:59:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069159276] [2024-11-08 23:59:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:27,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:59:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:59:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:59:27,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:59:27,082 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:27,156 INFO L93 Difference]: Finished difference Result 118 states and 171 transitions. [2024-11-08 23:59:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:59:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 23:59:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:27,160 INFO L225 Difference]: With dead ends: 118 [2024-11-08 23:59:27,161 INFO L226 Difference]: Without dead ends: 67 [2024-11-08 23:59:27,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:59:27,163 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 34 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:27,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 256 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:59:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-08 23:59:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2024-11-08 23:59:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:59:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-08 23:59:27,174 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 110 [2024-11-08 23:59:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:27,175 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-08 23:59:27,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-08 23:59:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:59:27,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:27,177 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:27,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:59:27,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:27,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -10846368, now seen corresponding path program 1 times [2024-11-08 23:59:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:59:27,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563558823] [2024-11-08 23:59:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:27,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:59:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:59:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:59:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:59:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:59:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:59:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:59:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:59:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:59:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:59:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:59:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:59:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:59:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:59:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:59:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:59:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:59:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:59:27,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:59:27,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563558823] [2024-11-08 23:59:27,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563558823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:27,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:27,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:59:27,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038278128] [2024-11-08 23:59:27,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:27,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:59:27,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:59:27,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:59:27,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:59:27,486 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:27,651 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-11-08 23:59:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:59:27,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 23:59:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:27,654 INFO L225 Difference]: With dead ends: 169 [2024-11-08 23:59:27,655 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:59:27,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:59:27,657 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 53 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:27,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:59:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:59:27,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2024-11-08 23:59:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:59:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2024-11-08 23:59:27,685 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 110 [2024-11-08 23:59:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:27,685 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2024-11-08 23:59:27,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-11-08 23:59:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:59:27,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:27,687 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:27,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:59:27,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:27,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1074410471, now seen corresponding path program 1 times [2024-11-08 23:59:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:59:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774769876] [2024-11-08 23:59:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:59:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:59:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:59:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:59:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:59:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:59:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:59:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:59:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:59:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:59:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:59:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:59:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:59:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:59:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:59:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:59:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:59:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,142 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 23:59:28,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:59:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774769876] [2024-11-08 23:59:28,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774769876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:59:28,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858867721] [2024-11-08 23:59:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:28,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:59:28,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:59:28,145 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-08 23:59:28,147 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-08 23:59:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:28,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:59:28,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:59:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-08 23:59:28,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:59:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 23:59:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858867721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:59:28,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:59:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 23:59:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735058577] [2024-11-08 23:59:28,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:59:28,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:59:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:59:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:59:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:59:28,656 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:59:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:28,839 INFO L93 Difference]: Finished difference Result 158 states and 224 transitions. [2024-11-08 23:59:28,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:59:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 111 [2024-11-08 23:59:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:28,843 INFO L225 Difference]: With dead ends: 158 [2024-11-08 23:59:28,843 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 23:59:28,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:59:28,844 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 136 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:28,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 124 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:59:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 23:59:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-08 23:59:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:59:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-08 23:59:28,869 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 111 [2024-11-08 23:59:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:28,870 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-08 23:59:28,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:59:28,870 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-08 23:59:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:59:28,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:28,874 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:28,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:59:29,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:59:29,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:29,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash -377726311, now seen corresponding path program 1 times [2024-11-08 23:59:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:59:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794804272] [2024-11-08 23:59:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:29,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:59:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:59:29,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:59:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:59:29,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:59:29,352 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:59:29,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:59:29,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:59:29,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:59:29,425 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:59:29,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:59:29 BoogieIcfgContainer [2024-11-08 23:59:29,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:59:29,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:59:29,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:59:29,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:59:29,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:25" (3/4) ... [2024-11-08 23:59:29,433 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:59:29,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:59:29,435 INFO L158 Benchmark]: Toolchain (without parser) took 4560.79ms. Allocated memory was 167.8MB in the beginning and 270.5MB in the end (delta: 102.8MB). Free memory was 96.1MB in the beginning and 186.0MB in the end (delta: -89.9MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,435 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:59:29,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.24ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 135.4MB in the end (delta: -39.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.10ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 135.4MB in the beginning and 194.6MB in the end (delta: -59.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,437 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 224.4MB. Free memory was 194.6MB in the beginning and 192.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,437 INFO L158 Benchmark]: RCFGBuilder took 424.56ms. Allocated memory is still 224.4MB. Free memory was 191.4MB in the beginning and 172.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,437 INFO L158 Benchmark]: TraceAbstraction took 3729.30ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 172.6MB in the beginning and 186.0MB in the end (delta: -13.4MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2024-11-08 23:59:29,437 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 270.5MB. Free memory is still 186.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:59:29,440 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.55ms. Allocated memory is still 167.8MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.24ms. Allocated memory is still 167.8MB. Free memory was 95.9MB in the beginning and 135.4MB in the end (delta: -39.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.10ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 135.4MB in the beginning and 194.6MB in the end (delta: -59.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 224.4MB. Free memory was 194.6MB in the beginning and 192.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.56ms. Allocated memory is still 224.4MB. Free memory was 191.4MB in the beginning and 172.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3729.30ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 172.6MB in the beginning and 186.0MB in the end (delta: -13.4MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 270.5MB. Free memory is still 186.0MB. 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 121, overapproximation of someUnaryDOUBLEoperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] unsigned long int last_1_var_1_10 = 128; [L40] unsigned long int last_1_var_1_16 = 1; [L41] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L125] isInitial = 1 [L126] FCALL initially() [L127] int k_loop; [L128] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L128] COND TRUE k_loop < 1 [L129] CALL updateLastVariables() [L116] last_1_var_1_10 = var_1_10 [L117] last_1_var_1_16 = var_1_16 [L118] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L129] RET updateLastVariables() [L130] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L97] var_1_8 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=4] [L100] var_1_9 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L101] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L102] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L103] var_1_11 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L104] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L106] var_1_17 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L107] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L108] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L109] var_1_18 = __VERIFIER_nondet_ulong() [L110] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L110] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L111] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L112] var_1_20 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L113] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L130] RET updateVariables() [L131] CALL step() [L45] unsigned long int stepLocal_1 = last_1_var_1_16; [L46] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L47] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L48] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=2, var_1_9=0] [L56] COND TRUE var_1_12 == var_1_12 [L57] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L59] var_1_1 = (var_1_2 || (! var_1_3)) [L60] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L61] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L62] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L63] COND FALSE !(var_1_19 >= var_1_19) [L68] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=1, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L73] COND TRUE var_1_19 != var_1_19 [L74] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L82] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L83] COND TRUE (var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2 [L84] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L131] RET step() [L132] CALL, EXPR property() [L121-L122] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=1879543162, var_1_11=2147483647, var_1_12=8, var_1_15=0, var_1_16=2, var_1_17=8589934590, var_1_18=4294967293, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=10, var_1_7=0, var_1_8=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 240 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 716 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 431 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 285 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=4, InterpolantAutomatonStates: 22, 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, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 3 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 3147/3264 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-08 23:59:29,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.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 4b73443b934cb8f13c6c3c0966f6912c28ac30fc0ad18f5f644522c4d2e3ecf6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:59:31,302 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:59:31,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:59:31,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:59:31,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:59:31,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:59:31,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:59:31,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:59:31,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:59:31,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:59:31,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:59:31,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:59:31,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:59:31,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:59:31,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:59:31,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:59:31,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:59:31,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:59:31,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:59:31,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:59:31,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:59:31,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:59:31,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:59:31,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:59:31,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:59:31,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:59:31,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:59:31,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:59:31,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:59:31,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:59:31,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:59:31,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:59:31,428 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:59:31,429 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:59:31,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:59:31,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:59:31,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:59:31,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:59:31,429 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 -> 4b73443b934cb8f13c6c3c0966f6912c28ac30fc0ad18f5f644522c4d2e3ecf6 [2024-11-08 23:59:31,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:59:31,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:59:31,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:59:31,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:59:31,736 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:59:31,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:33,157 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:59:33,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:59:33,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:33,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34ce097/4ec66e2003424bd1adc97bcbb2b73176/FLAGbea25d732 [2024-11-08 23:59:33,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34ce097/4ec66e2003424bd1adc97bcbb2b73176 [2024-11-08 23:59:33,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:59:33,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:59:33,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:33,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:59:33,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:59:33,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c85239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33, skipping insertion in model container [2024-11-08 23:59:33,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:59:33,577 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_50-1loop_file-11.i[915,928] [2024-11-08 23:59:33,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:33,652 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:59:33,664 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_50-1loop_file-11.i[915,928] [2024-11-08 23:59:33,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:59:33,716 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:59:33,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33 WrapperNode [2024-11-08 23:59:33,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:59:33,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:33,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:59:33,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:59:33,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,759 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-08 23:59:33,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:59:33,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:59:33,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:59:33,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:59:33,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,788 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-08 23:59:33,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:59:33,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:59:33,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:59:33,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:59:33,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (1/1) ... [2024-11-08 23:59:33,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:59:33,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:59:33,856 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-08 23:59:33,858 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-08 23:59:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:59:33,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:59:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:59:33,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:59:33,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:59:33,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:59:33,956 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:59:33,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:59:34,279 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 23:59:34,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:59:34,293 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:59:34,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:59:34,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:34 BoogieIcfgContainer [2024-11-08 23:59:34,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:59:34,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:59:34,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:59:34,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:59:34,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:59:33" (1/3) ... [2024-11-08 23:59:34,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bde495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:59:34, skipping insertion in model container [2024-11-08 23:59:34,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:59:33" (2/3) ... [2024-11-08 23:59:34,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bde495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:59:34, skipping insertion in model container [2024-11-08 23:59:34,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:59:34" (3/3) ... [2024-11-08 23:59:34,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-11.i [2024-11-08 23:59:34,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:59:34,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:59:34,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:59:34,397 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;@2e05a5b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:59:34,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:59:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:59:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:59:34,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:34,412 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:34,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:34,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:34,418 INFO L85 PathProgramCache]: Analyzing trace with hash 149126682, now seen corresponding path program 1 times [2024-11-08 23:59:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:59:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140431977] [2024-11-08 23:59:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:34,431 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-08 23:59:34,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:59:34,434 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-08 23:59:34,435 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-08 23:59:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:34,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:59:34,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:59:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-08 23:59:34,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:59:34,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:59:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140431977] [2024-11-08 23:59:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140431977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:34,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:59:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173467098] [2024-11-08 23:59:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:34,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:59:34,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:59:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:59:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:59:34,656 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:59:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:34,675 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-08 23:59:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:59:34,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2024-11-08 23:59:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:34,683 INFO L225 Difference]: With dead ends: 113 [2024-11-08 23:59:34,684 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 23:59:34,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-08 23:59:34,691 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:34,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:59:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 23:59:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 23:59:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 23:59:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-08 23:59:34,731 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 110 [2024-11-08 23:59:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:34,732 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-08 23:59:34,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 23:59:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-08 23:59:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 23:59:34,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:34,736 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:34,742 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-08 23:59:34,937 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-08 23:59:34,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:34,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:34,939 INFO L85 PathProgramCache]: Analyzing trace with hash -12693410, now seen corresponding path program 1 times [2024-11-08 23:59:34,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:59:34,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707799037] [2024-11-08 23:59:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:34,940 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-08 23:59:34,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:59:34,941 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-08 23:59:34,942 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-08 23:59:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:35,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:59:35,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:59:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:59:35,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:59:35,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:59:35,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707799037] [2024-11-08 23:59:35,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707799037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:35,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:35,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:59:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815454259] [2024-11-08 23:59:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:35,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:59:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:59:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:59:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:59:35,672 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:35,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:35,999 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-08 23:59:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:59:36,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 23:59:36,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:36,003 INFO L225 Difference]: With dead ends: 157 [2024-11-08 23:59:36,003 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 23:59:36,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:59:36,004 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 50 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:36,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 253 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:59:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 23:59:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2024-11-08 23:59:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:59:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2024-11-08 23:59:36,031 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 110 [2024-11-08 23:59:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2024-11-08 23:59:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2024-11-08 23:59:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 23:59:36,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:36,037 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:36,048 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-08 23:59:36,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:59:36,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:36,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:36,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1072563429, now seen corresponding path program 1 times [2024-11-08 23:59:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:59:36,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259877989] [2024-11-08 23:59:36,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:36,239 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-08 23:59:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:59:36,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:59:36,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:59:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:36,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:59:36,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:59:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 178 proven. 39 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-08 23:59:36,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:59:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-08 23:59:36,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:59:36,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259877989] [2024-11-08 23:59:36,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259877989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:59:36,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:59:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 23:59:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099228766] [2024-11-08 23:59:36,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:59:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:59:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:59:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:59:36,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:59:36,721 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:59:37,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:37,036 INFO L93 Difference]: Finished difference Result 154 states and 218 transitions. [2024-11-08 23:59:37,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:59:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 111 [2024-11-08 23:59:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:37,041 INFO L225 Difference]: With dead ends: 154 [2024-11-08 23:59:37,041 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 23:59:37,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:59:37,043 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 106 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:37,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 125 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:59:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 23:59:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-08 23:59:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 56 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:59:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-08 23:59:37,059 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 111 [2024-11-08 23:59:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:37,060 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-08 23:59:37,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:59:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-08 23:59:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 23:59:37,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:37,061 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:37,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:59:37,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:59:37,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:37,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:37,262 INFO L85 PathProgramCache]: Analyzing trace with hash -377726311, now seen corresponding path program 1 times [2024-11-08 23:59:37,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:59:37,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622318435] [2024-11-08 23:59:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:37,263 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-08 23:59:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:59:37,266 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-08 23:59:37,267 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-08 23:59:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:37,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:59:37,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:59:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 23:59:37,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:59:37,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:59:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622318435] [2024-11-08 23:59:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622318435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:59:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:59:37,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:59:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752014057] [2024-11-08 23:59:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:59:37,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:59:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:59:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:59:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:59:37,601 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:59:37,791 INFO L93 Difference]: Finished difference Result 154 states and 215 transitions. [2024-11-08 23:59:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:59:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-08 23:59:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:59:37,794 INFO L225 Difference]: With dead ends: 154 [2024-11-08 23:59:37,794 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 23:59:37,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:59:37,795 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 57 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:59:37,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 175 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:59:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 23:59:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2024-11-08 23:59:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 23:59:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 130 transitions. [2024-11-08 23:59:37,811 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 130 transitions. Word has length 112 [2024-11-08 23:59:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:59:37,812 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 130 transitions. [2024-11-08 23:59:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 23:59:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 130 transitions. [2024-11-08 23:59:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 23:59:37,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:59:37,813 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:59:37,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 23:59:38,013 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 [2024-11-08 23:59:38,014 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:59:38,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:59:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1869431304, now seen corresponding path program 1 times [2024-11-08 23:59:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:59:38,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021383787] [2024-11-08 23:59:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:59:38,015 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-08 23:59:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:59:38,017 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 23:59:38,020 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 (6)] Waiting until timeout for monitored process [2024-11-08 23:59:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:59:38,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 23:59:38,106 INFO L278 TraceCheckSpWp]: Computing forward predicates...