./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.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 b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:40:48,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:40:48,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:40:48,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:40:48,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:40:48,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:40:48,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:40:48,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:40:48,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:40:48,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:40:48,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:40:48,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:40:48,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:40:48,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:40:48,694 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:40:48,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:40:48,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:40:48,695 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:40:48,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:40:48,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:40:48,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:40:48,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:40:48,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:40:48,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:40:48,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:40:48,700 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:40:48,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:40:48,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:40:48,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:40:48,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:40:48,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:40:48,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:40:48,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:40:48,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:40:48,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:40:48,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:40:48,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:40:48,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:40:48,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:40:48,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:40:48,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:40:48,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:40:48,704 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 -> b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 [2024-11-10 07:40:48,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:40:48,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:40:48,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:40:48,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:40:48,964 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:40:48,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:40:50,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:40:50,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:40:50,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:40:50,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c62ec052/c5c08f7b56964e45ae5f1c82e3e3527d/FLAG2f345c730 [2024-11-10 07:40:50,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c62ec052/c5c08f7b56964e45ae5f1c82e3e3527d [2024-11-10 07:40:50,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:40:50,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:40:50,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:40:50,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:40:50,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:40:50,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:50" (1/1) ... [2024-11-10 07:40:50,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237c4976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:50, skipping insertion in model container [2024-11-10 07:40:50,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:50" (1/1) ... [2024-11-10 07:40:50,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:40:51,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-10 07:40:51,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:40:51,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:40:51,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-10 07:40:51,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:40:51,157 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:40:51,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51 WrapperNode [2024-11-10 07:40:51,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:40:51,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:40:51,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:40:51,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:40:51,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,213 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-10 07:40:51,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:40:51,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:40:51,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:40:51,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:40:51,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:40:51,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:40:51,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:40:51,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:40:51,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:40:51,247 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (1/1) ... [2024-11-10 07:40:51,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:40:51,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:40:51,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:40:51,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:40:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:40:51,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:40:51,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:40:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:40:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:40:51,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:40:51,418 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:40:51,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:40:51,654 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L100: havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2024-11-10 07:40:51,690 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:40:51,693 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:40:51,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:40:51,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:40:51,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:51 BoogieIcfgContainer [2024-11-10 07:40:51,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:40:51,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:40:51,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:40:51,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:40:51,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:40:50" (1/3) ... [2024-11-10 07:40:51,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229fd913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:40:51, skipping insertion in model container [2024-11-10 07:40:51,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:51" (2/3) ... [2024-11-10 07:40:51,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229fd913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:40:51, skipping insertion in model container [2024-11-10 07:40:51,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:51" (3/3) ... [2024-11-10 07:40:51,731 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:40:51,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:40:51,753 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:40:51,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:40:51,824 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;@64b19d81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:40:51,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:40:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:40:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 07:40:51,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:40:51,841 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:40:51,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:40:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:40:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash -973200631, now seen corresponding path program 1 times [2024-11-10 07:40:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:40:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079889464] [2024-11-10 07:40:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:40:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:40:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:40:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:40:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:40:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:40:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:40:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:40:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:40:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:40:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:40:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:40:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:40:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:40:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:40:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:40:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:40:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:40:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:40:52,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:40:52,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079889464] [2024-11-10 07:40:52,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079889464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:40:52,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:40:52,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:40:52,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849283277] [2024-11-10 07:40:52,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:40:52,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:40:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:40:52,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:40:52,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:40:52,188 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:40:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:40:52,213 INFO L93 Difference]: Finished difference Result 126 states and 207 transitions. [2024-11-10 07:40:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:40:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-11-10 07:40:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:40:52,222 INFO L225 Difference]: With dead ends: 126 [2024-11-10 07:40:52,222 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 07:40:52,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:40:52,228 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:40:52,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:40:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 07:40:52,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-10 07:40:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:40:52,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-10 07:40:52,295 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 106 [2024-11-10 07:40:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:40:52,299 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-10 07:40:52,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:40:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-10 07:40:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-10 07:40:52,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:40:52,327 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:40:52,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:40:52,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:40:52,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:40:52,331 INFO L85 PathProgramCache]: Analyzing trace with hash 289816427, now seen corresponding path program 1 times [2024-11-10 07:40:52,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:40:52,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034206198] [2024-11-10 07:40:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:40:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:40:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:40:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:40:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:40:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:40:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:40:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:40:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:40:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:40:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:40:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:40:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:40:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:40:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:40:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:40:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:40:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:40:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:40:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:40:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034206198] [2024-11-10 07:40:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034206198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:40:53,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:40:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:40:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305631928] [2024-11-10 07:40:53,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:40:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:40:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:40:53,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:40:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:40:53,011 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:40:53,218 INFO L93 Difference]: Finished difference Result 172 states and 246 transitions. [2024-11-10 07:40:53,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:40:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-11-10 07:40:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:40:53,221 INFO L225 Difference]: With dead ends: 172 [2024-11-10 07:40:53,222 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 07:40:53,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:40:53,224 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 57 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:40:53,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 476 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:40:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 07:40:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2024-11-10 07:40:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 71 states have internal predecessors, (89), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 07:40:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2024-11-10 07:40:53,247 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 106 [2024-11-10 07:40:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:40:53,247 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2024-11-10 07:40:53,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2024-11-10 07:40:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 07:40:53,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:40:53,249 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:40:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:40:53,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:40:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:40:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1157868604, now seen corresponding path program 1 times [2024-11-10 07:40:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:40:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093084096] [2024-11-10 07:40:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:40:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:40:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:40:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:40:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:40:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:40:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:40:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:40:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:40:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:40:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:40:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:40:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:40:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:40:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:40:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:40:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:40:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:40:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:40:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:40:53,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093084096] [2024-11-10 07:40:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093084096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:40:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:40:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:40:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071320280] [2024-11-10 07:40:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:40:53,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:40:53,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:40:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:40:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:40:53,324 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:40:53,359 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-11-10 07:40:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:40:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-10 07:40:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:40:53,361 INFO L225 Difference]: With dead ends: 199 [2024-11-10 07:40:53,361 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 07:40:53,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:40:53,363 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 58 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:40:53,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 186 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:40:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 07:40:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2024-11-10 07:40:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:40:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2024-11-10 07:40:53,370 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 107 [2024-11-10 07:40:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:40:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2024-11-10 07:40:53,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2024-11-10 07:40:53,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 07:40:53,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:40:53,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:40:53,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:40:53,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:40:53,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:40:53,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1926363968, now seen corresponding path program 1 times [2024-11-10 07:40:53,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:40:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002165287] [2024-11-10 07:40:53,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:40:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:40:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:40:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:40:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:40:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:40:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:40:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:40:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:40:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:40:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:40:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:40:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:40:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:40:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:40:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:40:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:40:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:40:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:40:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:40:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:40:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002165287] [2024-11-10 07:40:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002165287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:40:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:40:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:40:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350692373] [2024-11-10 07:40:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:40:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:40:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:40:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:40:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:40:54,305 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:40:54,674 INFO L93 Difference]: Finished difference Result 208 states and 272 transitions. [2024-11-10 07:40:54,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:40:54,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-10 07:40:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:40:54,677 INFO L225 Difference]: With dead ends: 208 [2024-11-10 07:40:54,677 INFO L226 Difference]: Without dead ends: 133 [2024-11-10 07:40:54,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:40:54,681 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 98 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:40:54,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 306 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:40:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-10 07:40:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 78. [2024-11-10 07:40:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:40:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2024-11-10 07:40:54,691 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 107 [2024-11-10 07:40:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:40:54,693 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2024-11-10 07:40:54,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:40:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2024-11-10 07:40:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 07:40:54,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:40:54,699 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:40:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:40:54,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:40:54,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:40:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -507865107, now seen corresponding path program 1 times [2024-11-10 07:40:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:40:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081266139] [2024-11-10 07:40:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:40:54,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:40:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:40:54,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:40:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:40:54,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:40:54,849 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:40:54,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:40:54,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:40:54,858 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 07:40:54,924 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:40:54,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:40:54 BoogieIcfgContainer [2024-11-10 07:40:54,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:40:54,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:40:54,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:40:54,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:40:54,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:40:51" (3/4) ... [2024-11-10 07:40:54,937 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:40:54,938 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:40:54,939 INFO L158 Benchmark]: Toolchain (without parser) took 4072.04ms. Allocated memory was 167.8MB in the beginning and 302.0MB in the end (delta: 134.2MB). Free memory was 96.0MB in the beginning and 231.7MB in the end (delta: -135.7MB). Peak memory consumption was 106.5kB. Max. memory is 16.1GB. [2024-11-10 07:40:54,939 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:40:54,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.21ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 138.1MB in the end (delta: -42.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-10 07:40:54,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.33ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 138.1MB in the beginning and 222.5MB in the end (delta: -84.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 07:40:54,940 INFO L158 Benchmark]: Boogie Preprocessor took 31.50ms. Allocated memory is still 251.7MB. Free memory was 222.5MB in the beginning and 220.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:40:54,940 INFO L158 Benchmark]: IcfgBuilder took 473.16ms. Allocated memory is still 251.7MB. Free memory was 220.4MB in the beginning and 201.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:40:54,941 INFO L158 Benchmark]: TraceAbstraction took 3204.50ms. Allocated memory was 251.7MB in the beginning and 302.0MB in the end (delta: 50.3MB). Free memory was 200.5MB in the beginning and 231.7MB in the end (delta: -31.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-10 07:40:54,941 INFO L158 Benchmark]: Witness Printer took 8.50ms. Allocated memory is still 302.0MB. Free memory is still 231.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:40:54,942 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.16ms. Allocated memory is still 167.8MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.21ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 138.1MB in the end (delta: -42.3MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.33ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 138.1MB in the beginning and 222.5MB in the end (delta: -84.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.50ms. Allocated memory is still 251.7MB. Free memory was 222.5MB in the beginning and 220.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 473.16ms. Allocated memory is still 251.7MB. Free memory was 220.4MB in the beginning and 201.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3204.50ms. Allocated memory was 251.7MB in the beginning and 302.0MB in the end (delta: 50.3MB). Free memory was 200.5MB in the beginning and 231.7MB in the end (delta: -31.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 8.50ms. Allocated memory is still 302.0MB. Free memory is still 231.7MB. 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 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -64; [L25] signed long int var_1_4 = -4; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] signed char var_1_7 = 32; [L29] signed char var_1_8 = -8; [L30] signed char var_1_9 = 10; [L31] double var_1_10 = 1.6; [L32] double var_1_11 = 127.25; [L33] double var_1_12 = 2.5; VAL [isInitial=0, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=0, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=-64, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L75] RET assume_abort_if_not(var_1_3 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] CALL assume_abort_if_not(var_1_3 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_3 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=-4, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L78] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=1, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L80] var_1_5 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L81] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L83] var_1_6 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L85] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=-8, var_1_9=10] [L86] var_1_8 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L87] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L88] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L88] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=10] [L89] var_1_9 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L90] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L91] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L91] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=8/5, var_1_11=509/4, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L92] var_1_11 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L93] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_12=5/2, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L94] var_1_12 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L95] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L108] RET updateVariables() [L109] CALL step() [L37] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L38] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))) VAL [isInitial=1, stepLocal_0=1073741823, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L56] unsigned char stepLocal_2 = var_1_5; [L57] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=3, stepLocal_2=-255, var_1_10=8/5, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L58] COND TRUE ! var_1_6 [L59] var_1_10 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, stepLocal_0=1073741823, stepLocal_1=3, stepLocal_2=-255, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L100] EXPR (! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L100] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L100-L101] return ((var_1_2 ? (var_1_1 == ((signed long int) (((((var_1_7 + var_1_7)) < (-16)) ? ((var_1_7 + var_1_7)) : (-16))))) : (var_1_5 ? (var_1_1 == ((signed long int) (var_1_7 + -4))) : (var_1_6 ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))))) && (var_1_6 ? ((var_1_3 <= var_1_4) ? (var_1_7 == ((signed char) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : 1) : 1)) && ((! var_1_6) ? (var_1_10 == ((double) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : (((var_1_7 | var_1_1) <= var_1_9) ? ((var_1_5 && var_1_6) ? (var_1_10 == ((double) var_1_12)) : (var_1_10 == ((double) 5.5))) : 1)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741828, var_1_11=1073741828, var_1_12=1073741828, var_1_1=-16, var_1_2=1, var_1_3=1073741823, var_1_4=1073741822, var_1_5=-255, var_1_6=0, var_1_7=32, var_1_8=4, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 1057 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 646 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 227 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 411 mSDtfsCounter, 227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 98 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 1090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1920/1920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:40:54,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.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 b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:40:57,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:40:57,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:40:57,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:40:57,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:40:57,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:40:57,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:40:57,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:40:57,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:40:57,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:40:57,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:40:57,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:40:57,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:40:57,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:40:57,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:40:57,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:40:57,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:40:57,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:40:57,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:40:57,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:40:57,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:40:57,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:40:57,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:40:57,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:40:57,197 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:40:57,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:40:57,197 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:40:57,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:40:57,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:40:57,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:40:57,199 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:40:57,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:40:57,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:40:57,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:40:57,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:40:57,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:40:57,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:40:57,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:40:57,201 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:40:57,201 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:40:57,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:40:57,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:40:57,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:40:57,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:40:57,202 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 -> b55245fdfeda07d3cc16ccf7855a16dd0888b0e85bdd23f4fc1ff2e8704085c2 [2024-11-10 07:40:57,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:40:57,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:40:57,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:40:57,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:40:57,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:40:57,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:40:59,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:40:59,226 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:40:59,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:40:59,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23cb3d5b5/f8cc956fb24b44dd96dbbab6385db807/FLAGfcab9c2f3 [2024-11-10 07:40:59,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23cb3d5b5/f8cc956fb24b44dd96dbbab6385db807 [2024-11-10 07:40:59,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:40:59,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:40:59,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:40:59,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:40:59,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:40:59,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1171c7b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59, skipping insertion in model container [2024-11-10 07:40:59,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:40:59,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-10 07:40:59,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:40:59,621 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:40:59,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-85.i[915,928] [2024-11-10 07:40:59,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:40:59,688 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:40:59,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59 WrapperNode [2024-11-10 07:40:59,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:40:59,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:40:59,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:40:59,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:40:59,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,739 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-10 07:40:59,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:40:59,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:40:59,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:40:59,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:40:59,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,771 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:40:59,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,785 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:40:59,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:40:59,810 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:40:59,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:40:59,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (1/1) ... [2024-11-10 07:40:59,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:40:59,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:40:59,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:40:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:40:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:40:59,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:40:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:40:59,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:40:59,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:40:59,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:41:00,000 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:41:00,006 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:41:00,215 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 07:41:00,215 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:41:00,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:41:00,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:41:00,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:41:00 BoogieIcfgContainer [2024-11-10 07:41:00,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:41:00,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:41:00,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:41:00,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:41:00,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:40:59" (1/3) ... [2024-11-10 07:41:00,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3b103a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:41:00, skipping insertion in model container [2024-11-10 07:41:00,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:40:59" (2/3) ... [2024-11-10 07:41:00,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3b103a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:41:00, skipping insertion in model container [2024-11-10 07:41:00,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:41:00" (3/3) ... [2024-11-10 07:41:00,248 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-85.i [2024-11-10 07:41:00,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:41:00,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:41:00,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:41:00,332 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;@20e160e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:41:00,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:41:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:41:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 07:41:00,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:41:00,348 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:41:00,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:41:00,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:41:00,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1053328491, now seen corresponding path program 1 times [2024-11-10 07:41:00,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:41:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947944767] [2024-11-10 07:41:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:41:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:41:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:41:00,372 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:41:00,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:41:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:41:00,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:41:00,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:41:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-10 07:41:00,548 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:41:00,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:41:00,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947944767] [2024-11-10 07:41:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947944767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:41:00,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:41:00,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:41:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459038688] [2024-11-10 07:41:00,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:41:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:41:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:41:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:41:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:41:00,576 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:41:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:41:00,598 INFO L93 Difference]: Finished difference Result 104 states and 173 transitions. [2024-11-10 07:41:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:41:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-10 07:41:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:41:00,606 INFO L225 Difference]: With dead ends: 104 [2024-11-10 07:41:00,606 INFO L226 Difference]: Without dead ends: 51 [2024-11-10 07:41:00,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:41:00,611 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:41:00,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:41:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-10 07:41:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 07:41:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:41:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-10 07:41:00,652 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 104 [2024-11-10 07:41:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:41:00,654 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-10 07:41:00,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:41:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-10 07:41:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 07:41:00,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:41:00,657 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:41:00,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:41:00,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:41:00,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:41:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:41:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1866418295, now seen corresponding path program 1 times [2024-11-10 07:41:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:41:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621503221] [2024-11-10 07:41:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:41:00,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:41:00,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:41:00,887 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:41:00,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:41:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:41:01,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 07:41:01,036 INFO L278 TraceCheckSpWp]: Computing forward predicates...