./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:02,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:02,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:29:02,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:02,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:03,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:03,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:03,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:03,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:03,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:03,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:03,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:03,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:03,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:03,010 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:03,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:03,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:03,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:03,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:29:03,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:03,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:03,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:03,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:03,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:03,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:03,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:03,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:03,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:03,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:03,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:03,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:03,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:29:03,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:29:03,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:03,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:03,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:03,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:03,019 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 -> b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c [2024-10-24 09:29:03,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:03,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:03,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:03,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:03,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:03,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:04,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:04,603 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:04,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:04,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54edae252/bb2d65ef620a4d17b3ba19aa4cf5d8cb/FLAG49fc990ec [2024-10-24 09:29:04,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54edae252/bb2d65ef620a4d17b3ba19aa4cf5d8cb [2024-10-24 09:29:04,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:04,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:04,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:04,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:04,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:04,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bad8cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04, skipping insertion in model container [2024-10-24 09:29:04,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:04,803 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-10-24 09:29:04,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:04,853 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:04,863 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-10-24 09:29:04,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:04,893 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:04,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04 WrapperNode [2024-10-24 09:29:04,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:04,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:04,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:04,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:04,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,932 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-24 09:29:04,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:04,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:04,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:04,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:04,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,956 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-10-24 09:29:04,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:04,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:04,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:04,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:04,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (1/1) ... [2024-10-24 09:29:04,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:05,013 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-10-24 09:29:05,016 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-10-24 09:29:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:05,050 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:29:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:05,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:05,170 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:05,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:29:05,465 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 09:29:05,465 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:29:05,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:29:05,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:29:05,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:05 BoogieIcfgContainer [2024-10-24 09:29:05,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:29:05,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:29:05,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:29:05,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:29:05,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:29:04" (1/3) ... [2024-10-24 09:29:05,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:05, skipping insertion in model container [2024-10-24 09:29:05,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:04" (2/3) ... [2024-10-24 09:29:05,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:05, skipping insertion in model container [2024-10-24 09:29:05,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:05" (3/3) ... [2024-10-24 09:29:05,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:05,514 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:29:05,514 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:29:05,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:29:05,559 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;@5cf1eab5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:29:05,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:29:05,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 09:29:05,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:05,569 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:05,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2116131435, now seen corresponding path program 1 times [2024-10-24 09:29:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448790168] [2024-10-24 09:29:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:29:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:29:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:29:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:29:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:29:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 09:29:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448790168] [2024-10-24 09:29:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448790168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:29:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254829625] [2024-10-24 09:29:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:05,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:29:05,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:05,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:29:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:05,807 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:05,842 INFO L93 Difference]: Finished difference Result 93 states and 153 transitions. [2024-10-24 09:29:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:29:05,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 78 [2024-10-24 09:29:05,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:05,851 INFO L225 Difference]: With dead ends: 93 [2024-10-24 09:29:05,851 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 09:29:05,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:05,856 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:05,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:29:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 09:29:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 09:29:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-10-24 09:29:05,885 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 78 [2024-10-24 09:29:05,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:05,885 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-10-24 09:29:05,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-10-24 09:29:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 09:29:05,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:05,889 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:29:05,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:05,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash 18293995, now seen corresponding path program 1 times [2024-10-24 09:29:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:05,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437719543] [2024-10-24 09:29:05,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:05,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:29:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:29:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:29:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:29:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:29:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:29:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:29:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:29:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:29:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:29:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:29:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:29:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 09:29:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437719543] [2024-10-24 09:29:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437719543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:06,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:29:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036171029] [2024-10-24 09:29:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:29:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:06,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:29:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:29:06,252 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:06,404 INFO L93 Difference]: Finished difference Result 127 states and 183 transitions. [2024-10-24 09:29:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:29:06,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2024-10-24 09:29:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:06,409 INFO L225 Difference]: With dead ends: 127 [2024-10-24 09:29:06,410 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 09:29:06,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-24 09:29:06,411 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:06,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 114 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:29:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 09:29:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2024-10-24 09:29:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-24 09:29:06,423 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 78 [2024-10-24 09:29:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:06,424 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-24 09:29:06,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-24 09:29:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 09:29:06,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:06,427 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:06,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:29:06,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:06,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1831732764, now seen corresponding path program 1 times [2024-10-24 09:29:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:06,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240066803] [2024-10-24 09:29:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:06,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:29:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684257168] [2024-10-24 09:29:06,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:06,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:06,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:06,487 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-10-24 09:29:06,488 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-10-24 09:29:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:06,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:29:06,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 09:29:06,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 09:29:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:29:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240066803] [2024-10-24 09:29:06,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:29:06,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684257168] [2024-10-24 09:29:06,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684257168] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:06,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:29:06,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-24 09:29:06,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619141005] [2024-10-24 09:29:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:06,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:29:06,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:29:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:29:06,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-24 09:29:06,990 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:07,451 INFO L93 Difference]: Finished difference Result 115 states and 163 transitions. [2024-10-24 09:29:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:29:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-24 09:29:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:07,457 INFO L225 Difference]: With dead ends: 115 [2024-10-24 09:29:07,457 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 09:29:07,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:29:07,459 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 131 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:29:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 09:29:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2024-10-24 09:29:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-10-24 09:29:07,464 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 79 [2024-10-24 09:29:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-10-24 09:29:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-10-24 09:29:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 09:29:07,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:07,466 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:07,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:29:07,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:07,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:07,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1888991066, now seen corresponding path program 1 times [2024-10-24 09:29:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:29:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796938074] [2024-10-24 09:29:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:29:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:29:07,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544436963] [2024-10-24 09:29:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:07,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:29:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:07,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:29:07,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:29:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:07,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:29:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:29:07,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:29:07,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:29:07,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:29:07,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:29:08,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 09:29:08,035 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:29:08,079 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:29:08,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:29:08 BoogieIcfgContainer [2024-10-24 09:29:08,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:29:08,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:29:08,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:29:08,083 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:29:08,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:05" (3/4) ... [2024-10-24 09:29:08,085 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:29:08,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:29:08,086 INFO L158 Benchmark]: Toolchain (without parser) took 3455.13ms. Allocated memory is still 192.9MB. Free memory was 125.6MB in the beginning and 63.6MB in the end (delta: 62.0MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,086 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:08,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.80ms. Allocated memory is still 192.9MB. Free memory was 125.3MB in the beginning and 111.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.21ms. Allocated memory is still 192.9MB. Free memory was 111.4MB in the beginning and 108.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,087 INFO L158 Benchmark]: Boogie Preprocessor took 48.65ms. Allocated memory is still 192.9MB. Free memory was 108.1MB in the beginning and 104.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,087 INFO L158 Benchmark]: RCFGBuilder took 512.38ms. Allocated memory is still 192.9MB. Free memory was 104.3MB in the beginning and 146.0MB in the end (delta: -41.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,088 INFO L158 Benchmark]: TraceAbstraction took 2585.80ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 63.6MB in the end (delta: 82.5MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2024-10-24 09:29:08,088 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 192.9MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:29:08,089 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.12ms. Allocated memory is still 127.9MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.80ms. Allocated memory is still 192.9MB. Free memory was 125.3MB in the beginning and 111.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.21ms. Allocated memory is still 192.9MB. Free memory was 111.4MB in the beginning and 108.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.65ms. Allocated memory is still 192.9MB. Free memory was 108.1MB in the beginning and 104.3MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 512.38ms. Allocated memory is still 192.9MB. Free memory was 104.3MB in the beginning and 146.0MB in the end (delta: -41.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2585.80ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 63.6MB in the end (delta: 82.5MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 192.9MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_3 = 2941876006; [L24] double var_1_5 = 127.422; [L25] unsigned short int var_1_6 = 10; [L26] unsigned char var_1_7 = 1; [L27] unsigned long int var_1_9 = 4; [L28] unsigned short int var_1_11 = 44699; [L29] signed short int var_1_13 = 2; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 16; [L32] float var_1_17 = 8.125; [L86] isInitial = 1 [L87] FCALL initially() [L88] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=2941876006, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L89] COND TRUE k_loop < 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L60] var_1_3 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L61] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L62] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_5=63711/500, var_1_6=10, var_1_7=1, var_1_9=4] [L63] var_1_5 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L64] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=1, var_1_9=4] [L65] var_1_7 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L66] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_9=4] [L67] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L67] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=4] [L68] var_1_9 = __VERIFIER_nondet_ulong() [L69] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L69] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L70] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L70] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0] [L71] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L71] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, var_1_11=44699, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L72] var_1_11 = __VERIFIER_nondet_ushort() [L73] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L73] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L74] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=16, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L75] var_1_16 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=65/8, var_1_1=9/10, var_1_3=-2147483649, var_1_6=10, var_1_7=0, var_1_9=1] [L91] RET updateVariables() [L92] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] EXPR var_1_15 & var_1_15 VAL [isInitial=1, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=10, var_1_7=0, var_1_9=1] [L38] unsigned long int stepLocal_2 = var_1_3 * (var_1_15 & var_1_15); [L39] COND FALSE !(\read(var_1_7)) [L46] var_1_6 = (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1) VAL [isInitial=1, stepLocal_2=0, var_1_11=-32769, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L48] var_1_13 = var_1_15 [L49] signed long int stepLocal_1 = var_1_6 * var_1_15; [L50] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L51] COND TRUE stepLocal_0 <= (var_1_3 - var_1_6) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=9/10, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L52] COND FALSE !(var_1_3 < stepLocal_1) [L55] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_2=0, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L92] RET step() [L93] CALL, EXPR property() [L82] EXPR ((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1)))) VAL [isInitial=1, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L82-L83] return (((((var_1_15 <= (var_1_3 - var_1_6)) ? ((var_1_3 < (var_1_6 * var_1_15)) ? (var_1_1 == ((double) var_1_5)) : (var_1_1 == ((double) var_1_5))) : 1) && (var_1_7 ? (((var_1_3 * (var_1_15 & var_1_15)) <= (var_1_15 / var_1_9)) ? (var_1_6 == ((unsigned short int) (47342 - var_1_15))) : (var_1_6 == ((unsigned short int) (var_1_11 - ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) : (var_1_6 == ((unsigned short int) (((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) + 1))))) && (var_1_13 == ((signed short int) var_1_15))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((float) var_1_5)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=-32769, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=2, var_1_3=-2147483649, var_1_5=2, var_1_6=1, var_1_7=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 158 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 310 ConstructedInterpolants, 3 QuantifiedInterpolants, 695 SizeOfPredicates, 4 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1023/1056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:29:08,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:29:09,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:29:09,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:29:09,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:29:09,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:29:09,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:29:09,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:29:09,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:29:09,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:29:09,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:29:09,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:29:09,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:29:09,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:29:09,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:29:09,952 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:29:09,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:29:09,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:29:09,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:29:09,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:29:09,953 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:29:09,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:29:09,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:29:09,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:29:09,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:29:09,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:29:09,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:29:09,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:29:09,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:29:09,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:29:09,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:09,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:29:09,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:29:09,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:29:09,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:29:09,958 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:09,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:29:09,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:29:09,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:29:09,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:29:09,961 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:29:09,961 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 -> b6dd2ed6c1bce1a10f9a63c051c029a066fa5b3cc478546a4f140edcb3bcb50c [2024-10-24 09:29:10,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:29:10,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:29:10,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:29:10,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:29:10,243 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:29:10,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:11,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:29:11,616 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:29:11,617 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:11,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69b0b808/6c8eba7f4ca9427bbf303f9a90c233f6/FLAGb2cb1be38 [2024-10-24 09:29:11,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69b0b808/6c8eba7f4ca9427bbf303f9a90c233f6 [2024-10-24 09:29:11,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:29:11,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:29:11,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:11,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:29:11,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:29:11,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69d151c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11, skipping insertion in model container [2024-10-24 09:29:11,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:29:11,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-10-24 09:29:11,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:11,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:29:11,854 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-64.i[915,928] [2024-10-24 09:29:11,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:29:11,893 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:29:11,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11 WrapperNode [2024-10-24 09:29:11,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:29:11,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:11,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:29:11,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:29:11,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,935 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-24 09:29:11,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:29:11,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:29:11,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:29:11,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:29:11,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,962 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-10-24 09:29:11,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:29:11,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:29:11,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:29:11,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:29:11,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (1/1) ... [2024-10-24 09:29:11,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:29:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:29:12,009 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-10-24 09:29:12,012 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-10-24 09:29:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:29:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:29:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:29:12,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:29:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:29:12,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:29:12,103 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:29:12,105 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:29:12,464 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 09:29:12,464 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:29:12,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:29:12,524 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:29:12,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:12 BoogieIcfgContainer [2024-10-24 09:29:12,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:29:12,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:29:12,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:29:12,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:29:12,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:29:11" (1/3) ... [2024-10-24 09:29:12,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b36deb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:12, skipping insertion in model container [2024-10-24 09:29:12,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:29:11" (2/3) ... [2024-10-24 09:29:12,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b36deb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:29:12, skipping insertion in model container [2024-10-24 09:29:12,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:29:12" (3/3) ... [2024-10-24 09:29:12,532 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-64.i [2024-10-24 09:29:12,544 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:29:12,544 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:29:12,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:29:12,597 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;@7283e5c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:29:12,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:29:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 09:29:12,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:12,608 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:12,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1111848029, now seen corresponding path program 1 times [2024-10-24 09:29:12,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:12,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821478288] [2024-10-24 09:29:12,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:12,628 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-10-24 09:29:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:12,630 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-10-24 09:29:12,631 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-10-24 09:29:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:29:12,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-24 09:29:12,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:29:12,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821478288] [2024-10-24 09:29:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821478288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:29:12,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:29:12,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:29:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195413305] [2024-10-24 09:29:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:29:12,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:29:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:29:12,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:29:12,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:29:12,840 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:12,911 INFO L93 Difference]: Finished difference Result 71 states and 119 transitions. [2024-10-24 09:29:12,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:29:12,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2024-10-24 09:29:12,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:12,919 INFO L225 Difference]: With dead ends: 71 [2024-10-24 09:29:12,919 INFO L226 Difference]: Without dead ends: 34 [2024-10-24 09:29:12,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-10-24 09:29:12,923 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:12,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:29:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-24 09:29:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-24 09:29:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2024-10-24 09:29:12,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 74 [2024-10-24 09:29:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:12,953 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2024-10-24 09:29:12,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 09:29:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2024-10-24 09:29:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 09:29:12,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:12,955 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:12,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:29:13,156 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-10-24 09:29:13,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2048480803, now seen corresponding path program 1 times [2024-10-24 09:29:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154455425] [2024-10-24 09:29:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:13,158 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-10-24 09:29:13,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:13,159 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-10-24 09:29:13,161 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-10-24 09:29:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:13,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:29:13,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 09:29:13,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:13,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154455425] [2024-10-24 09:29:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154455425] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338850857] [2024-10-24 09:29:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:13,611 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:13,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:29:13,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:29:13,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-24 09:29:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:13,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:29:13,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 09:29:14,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [338850857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:14,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:29:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-24 09:29:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116686698] [2024-10-24 09:29:14,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:29:14,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:29:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:29:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:29:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:29:14,133 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:14,744 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2024-10-24 09:29:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:29:14,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2024-10-24 09:29:14,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:14,746 INFO L225 Difference]: With dead ends: 82 [2024-10-24 09:29:14,747 INFO L226 Difference]: Without dead ends: 49 [2024-10-24 09:29:14,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:29:14,748 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:14,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 65 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:29:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-24 09:29:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2024-10-24 09:29:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-10-24 09:29:14,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 74 [2024-10-24 09:29:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-10-24 09:29:14,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-10-24 09:29:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 09:29:14,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:14,763 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:14,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-24 09:29:14,970 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-10-24 09:29:15,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:29:15,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:15,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash -930907023, now seen corresponding path program 1 times [2024-10-24 09:29:15,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:15,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140718207] [2024-10-24 09:29:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:15,166 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-10-24 09:29:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:15,167 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-10-24 09:29:15,168 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-10-24 09:29:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:15,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:29:15,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 09:29:15,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:15,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:29:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140718207] [2024-10-24 09:29:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140718207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2081110844] [2024-10-24 09:29:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:15,597 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:29:15,599 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:29:15,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 09:29:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:15,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:29:15,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 09:29:15,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:29:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2081110844] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:29:16,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:29:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-24 09:29:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448631184] [2024-10-24 09:29:16,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:29:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:29:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:29:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:29:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:29:16,040 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:29:17,049 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2024-10-24 09:29:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:29:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 75 [2024-10-24 09:29:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:29:17,053 INFO L225 Difference]: With dead ends: 77 [2024-10-24 09:29:17,053 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 09:29:17,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:29:17,058 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:29:17,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 73 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 09:29:17,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 09:29:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-24 09:29:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 09:29:17,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-10-24 09:29:17,064 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 75 [2024-10-24 09:29:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:29:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-10-24 09:29:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 09:29:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-10-24 09:29:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 09:29:17,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:29:17,066 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:29:17,076 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-10-24 09:29:17,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-24 09:29:17,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 09:29:17,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:29:17,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:29:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash -930847441, now seen corresponding path program 1 times [2024-10-24 09:29:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:29:17,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897873686] [2024-10-24 09:29:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:29:17,468 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-10-24 09:29:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:29:17,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:29:17,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 09:29:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:29:17,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:29:17,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:29:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-24 09:29:32,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:30:26,963 WARN L286 SmtUtils]: Spent 11.53s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)