./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:05:54,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:05:54,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:05:54,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:05:54,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:05:54,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:05:54,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:05:54,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:05:54,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:05:54,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:05:54,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:05:54,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:05:54,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:05:54,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:05:54,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:05:54,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:05:54,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:05:54,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:05:54,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:05:54,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:05:54,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:05:54,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:05:54,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:05:54,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:05:54,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:05:54,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:05:54,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:05:54,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:05:54,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:05:54,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:05:54,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:05:54,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:05:54,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:05:54,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:05:54,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:05:54,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:05:54,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:05:54,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:05:54,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:05:54,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:05:54,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:05:54,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:05:54,584 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2024-10-13 04:05:54,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:05:54,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:05:54,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:05:54,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:05:54,923 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:05:54,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:05:56,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:05:56,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:05:56,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:05:56,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e5b4c79/ef49a061acbc412dbf8681710e39c1df/FLAGda4bb3b07 [2024-10-13 04:05:56,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7e5b4c79/ef49a061acbc412dbf8681710e39c1df [2024-10-13 04:05:56,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:05:56,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:05:56,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:05:56,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:05:56,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:05:56,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac4422a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56, skipping insertion in model container [2024-10-13 04:05:56,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:05:56,767 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-10-13 04:05:56,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:05:56,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:05:56,830 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-10-13 04:05:56,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:05:56,867 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:05:56,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56 WrapperNode [2024-10-13 04:05:56,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:05:56,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:05:56,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:05:56,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:05:56,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,914 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-13 04:05:56,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:05:56,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:05:56,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:05:56,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:05:56,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:05:56,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:05:56,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:05:56,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:05:56,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:05:56,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (1/1) ... [2024-10-13 04:05:56,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:05:56,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:05:57,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:05:57,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:05:57,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:05:57,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:05:57,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:05:57,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:05:57,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:05:57,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:05:57,158 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:05:57,160 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:05:57,562 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 04:05:57,563 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:05:57,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:05:57,616 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:05:57,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:57 BoogieIcfgContainer [2024-10-13 04:05:57,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:05:57,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:05:57,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:05:57,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:05:57,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:05:56" (1/3) ... [2024-10-13 04:05:57,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7616dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:57, skipping insertion in model container [2024-10-13 04:05:57,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:05:56" (2/3) ... [2024-10-13 04:05:57,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7616dd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:05:57, skipping insertion in model container [2024-10-13 04:05:57,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:57" (3/3) ... [2024-10-13 04:05:57,628 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:05:57,643 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:05:57,644 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:05:57,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:05:57,726 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;@48a7e32d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:05:57,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:05:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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-10-13 04:05:57,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 04:05:57,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:05:57,745 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] [2024-10-13 04:05:57,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:05:57,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:05:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1667147799, now seen corresponding path program 1 times [2024-10-13 04:05:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:05:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063331860] [2024-10-13 04:05:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:05:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:05:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:05:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:57,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:05:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:05:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:05:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:05:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:05:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:05:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:05:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:05:58,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:05:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:05:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:05:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:05:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:05:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:05:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:05:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:05:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:05:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063331860] [2024-10-13 04:05:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063331860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:05:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:05:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:05:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972954208] [2024-10-13 04:05:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:05:58,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:05:58,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:05:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:05:58,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:05:58,156 INFO L87 Difference]: Start difference. First operand has 55 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-10-13 04:05:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:05:58,196 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2024-10-13 04:05:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:05:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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 102 [2024-10-13 04:05:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:05:58,205 INFO L225 Difference]: With dead ends: 109 [2024-10-13 04:05:58,206 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 04:05:58,209 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-10-13 04:05:58,212 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:05:58,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:05:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 04:05:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 04:05:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 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-10-13 04:05:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions. [2024-10-13 04:05:58,256 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 102 [2024-10-13 04:05:58,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:05:58,256 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 80 transitions. [2024-10-13 04:05:58,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (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-10-13 04:05:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions. [2024-10-13 04:05:58,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-13 04:05:58,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:05:58,264 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] [2024-10-13 04:05:58,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:05:58,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:05:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:05:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -863729047, now seen corresponding path program 1 times [2024-10-13 04:05:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:05:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507792860] [2024-10-13 04:05:58,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:05:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:05:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:05:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:05:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:05:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:05:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:05:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:05:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:05:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:05:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:05:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:05:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:05:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:05:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:05:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:05:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:05:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:05:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:05:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:05:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507792860] [2024-10-13 04:05:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507792860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:05:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:05:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:05:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928002911] [2024-10-13 04:05:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:05:58,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:05:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:05:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:05:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:05:58,876 INFO L87 Difference]: Start difference. First operand 53 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-13 04:05:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:05:59,105 INFO L93 Difference]: Finished difference Result 158 states and 239 transitions. [2024-10-13 04:05:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:05:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 102 [2024-10-13 04:05:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:05:59,109 INFO L225 Difference]: With dead ends: 158 [2024-10-13 04:05:59,109 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 04:05:59,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:05:59,111 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 58 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:05:59,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 187 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:05:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 04:05:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-10-13 04:05:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:05:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2024-10-13 04:05:59,140 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 102 [2024-10-13 04:05:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:05:59,142 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2024-10-13 04:05:59,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10-13 04:05:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-10-13 04:05:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-13 04:05:59,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:05:59,144 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-10-13 04:05:59,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:05:59,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:05:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:05:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1943056511, now seen corresponding path program 1 times [2024-10-13 04:05:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:05:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052091754] [2024-10-13 04:05:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:05:59,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:05:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:05:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:05:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:05:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:05:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:05:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:05:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:05:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:05:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:05:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:05:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:05:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:05:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:05:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:05:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:05:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:05:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:05:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:05:59,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:05:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052091754] [2024-10-13 04:05:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052091754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:05:59,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:05:59,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:05:59,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458656439] [2024-10-13 04:05:59,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:05:59,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:05:59,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:05:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:05:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:05:59,518 INFO L87 Difference]: Start difference. First operand 98 states and 147 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-10-13 04:05:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:05:59,617 INFO L93 Difference]: Finished difference Result 180 states and 269 transitions. [2024-10-13 04:05:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:05:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-10-13 04:05:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:05:59,620 INFO L225 Difference]: With dead ends: 180 [2024-10-13 04:05:59,620 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 04:05:59,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:05:59,624 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:05:59,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:05:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 04:05:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2024-10-13 04:05:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 states have internal predecessors, (78), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:05:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2024-10-13 04:05:59,650 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 106 [2024-10-13 04:05:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:05:59,650 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 142 transitions. [2024-10-13 04:05:59,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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-10-13 04:05:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 142 transitions. [2024-10-13 04:05:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 04:05:59,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:05:59,653 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-10-13 04:05:59,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:05:59,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:05:59,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:05:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash -582396692, now seen corresponding path program 1 times [2024-10-13 04:05:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:05:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765601212] [2024-10-13 04:05:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:05:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:05:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:06:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:06:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:06:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:06:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:06:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:06:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:06:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:06:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:06:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 04:06:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:06:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:06:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:06:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 04:06:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:06:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 04:06:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:06:00,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:06:00,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765601212] [2024-10-13 04:06:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765601212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:06:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229901559] [2024-10-13 04:06:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:06:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:06:00,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:06:00,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:06:00,402 INFO L87 Difference]: Start difference. First operand 96 states and 142 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-10-13 04:06:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:00,604 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-13 04:06:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:06:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-10-13 04:06:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:00,606 INFO L225 Difference]: With dead ends: 184 [2024-10-13 04:06:00,607 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 04:06:00,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:00,612 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 53 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:00,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 181 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:06:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 04:06:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2024-10-13 04:06:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:06:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2024-10-13 04:06:00,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 107 [2024-10-13 04:06:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2024-10-13 04:06:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-10-13 04:06:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2024-10-13 04:06:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 04:06:00,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:00,632 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-10-13 04:06:00,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:06:00,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:00,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:00,633 INFO L85 PathProgramCache]: Analyzing trace with hash 20656184, now seen corresponding path program 1 times [2024-10-13 04:06:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:06:00,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581250840] [2024-10-13 04:06:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:06:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:06:00,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1596741097] [2024-10-13 04:06:00,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:00,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:06:00,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:06:00,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:06:00,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:06:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:06:00,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:06:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:06:00,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:06:00,953 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:06:00,954 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:06:00,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:06:01,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:06:01,160 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 04:06:01,239 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:06:01,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:06:01 BoogieIcfgContainer [2024-10-13 04:06:01,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:06:01,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:06:01,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:06:01,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:06:01,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:05:57" (3/4) ... [2024-10-13 04:06:01,249 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:06:01,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:06:01,251 INFO L158 Benchmark]: Toolchain (without parser) took 4690.32ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 133.7MB in the beginning and 99.4MB in the end (delta: 34.4MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,251 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:06:01,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.31ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 119.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.08ms. Allocated memory is still 161.5MB. Free memory was 119.2MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,252 INFO L158 Benchmark]: Boogie Preprocessor took 51.40ms. Allocated memory is still 161.5MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,252 INFO L158 Benchmark]: RCFGBuilder took 649.23ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 116.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,253 INFO L158 Benchmark]: TraceAbstraction took 3625.98ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 115.7MB in the beginning and 99.4MB in the end (delta: 16.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-10-13 04:06:01,253 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 195.0MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:06:01,255 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.31ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 119.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.08ms. Allocated memory is still 161.5MB. Free memory was 119.2MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.40ms. Allocated memory is still 161.5MB. Free memory was 117.1MB in the beginning and 115.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.23ms. Allocated memory is still 161.5MB. Free memory was 115.0MB in the beginning and 116.5MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3625.98ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 115.7MB in the beginning and 99.4MB in the end (delta: 16.3MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 195.0MB. Free memory is still 99.4MB. 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 someBinaryFLOATComparisonOperation at line 99, overapproximation of bitwiseOr at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_6 = 32; [L24] signed short int var_1_7 = 18477; [L25] signed short int var_1_8 = 5; [L26] float var_1_9 = 100.8; [L27] unsigned long int var_1_10 = 256; [L28] unsigned char var_1_11 = 0; [L29] unsigned char var_1_12 = 10; [L30] unsigned long int var_1_13 = 1879106797; [L31] unsigned long int var_1_14 = 1581421231; [L32] signed long int var_1_15 = -32; [L33] unsigned long int last_1_var_1_10 = 256; [L34] signed long int last_1_var_1_15 = -32; [L103] isInitial = 1 [L104] FCALL initially() [L105] int k_loop; [L106] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L106] COND TRUE k_loop < 1 [L107] CALL updateLastVariables() [L95] last_1_var_1_10 = var_1_10 [L96] last_1_var_1_15 = var_1_15 [L107] RET updateLastVariables() [L108] CALL updateVariables() [L69] var_1_6 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L71] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=18477, var_1_8=5, var_1_9=504/5] [L72] var_1_7 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L73] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L74] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=5, var_1_9=504/5] [L75] var_1_8 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L77] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=504/5] [L78] var_1_9 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L80] var_1_11 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L81] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L82] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=10, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1879106797, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L87] var_1_13 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L88] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L89] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=1581421231, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L90] var_1_14 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_14 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L91] RET assume_abort_if_not(var_1_14 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L92] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L108] RET updateVariables() [L109] CALL step() [L38] unsigned long int stepLocal_1 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=397/4, var_1_6=32767, var_1_7=16383, var_1_8=16383] [L39] unsigned long int stepLocal_0 = last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))); [L40] COND FALSE !(stepLocal_0 != last_1_var_1_10) [L45] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L47] signed short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=256, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L48] COND FALSE !(\read(var_1_11)) [L55] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L57] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=-32, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L58] COND FALSE !(var_1_1 <= var_1_9) [L65] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, stepLocal_1=256, stepLocal_2=32767, stepLocal_3=16383, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L109] RET step() [L110] CALL, EXPR property() [L99] EXPR last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L99-L100] return ((((last_1_var_1_10 ^ ((((last_1_var_1_15) > (last_1_var_1_10)) ? (last_1_var_1_15) : (last_1_var_1_10)))) != last_1_var_1_10) ? ((last_1_var_1_10 == (var_1_6 - (var_1_7 - var_1_8))) ? (var_1_1 == ((float) var_1_9)) : 1) : (var_1_1 == ((float) var_1_9))) && (var_1_11 ? (((var_1_7 % var_1_12) >= var_1_6) ? (var_1_10 == ((unsigned long int) ((var_1_13 + var_1_14) - var_1_7))) : (var_1_10 == ((unsigned long int) var_1_12))) : (var_1_10 == ((unsigned long int) var_1_7)))) && ((var_1_1 <= var_1_9) ? ((var_1_10 > (last_1_var_1_15 + (var_1_10 + var_1_7))) ? (var_1_15 == ((signed long int) var_1_7)) : (var_1_15 == ((signed long int) -5))) : (var_1_15 == ((signed long int) var_1_7))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_15=-32, var_1_10=16383, var_1_11=0, var_1_12=140, var_1_13=1073741823, var_1_14=-3221225472, var_1_15=16383, var_1_1=2, var_1_6=32767, var_1_7=16383, var_1_8=16383, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 140 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 140 mSDsluCounter, 680 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 417 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 263 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=4, InterpolantAutomatonStates: 15, 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, 38 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 633 NumberOfCodeBlocks, 633 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 413 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 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-10-13 04:06:01,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.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 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:06:03,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:06:03,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:06:03,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:06:03,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:06:03,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:06:03,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:06:03,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:06:03,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:06:03,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:06:03,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:06:03,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:06:03,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:06:03,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:06:03,616 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:06:03,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:06:03,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:06:03,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:06:03,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:06:03,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:06:03,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:06:03,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:06:03,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:06:03,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:06:03,623 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:06:03,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:06:03,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:06:03,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:06:03,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:06:03,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:06:03,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:06:03,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:06:03,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:06:03,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:06:03,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:03,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:06:03,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:06:03,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:06:03,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:06:03,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:06:03,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:06:03,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:06:03,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:06:03,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:06:03,628 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:06:03,629 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 -> 69e3fd0d89ff67704309f926d24cfd61e1dc768d923ba7c9bb18b30d139558fd [2024-10-13 04:06:03,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:06:03,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:06:03,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:06:04,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:06:04,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:06:04,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:06:05,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:06:05,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:06:05,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:06:05,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7edb97eb3/afb13c78735b42e5a06ddd525b37d1d2/FLAGe300d3285 [2024-10-13 04:06:06,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7edb97eb3/afb13c78735b42e5a06ddd525b37d1d2 [2024-10-13 04:06:06,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:06:06,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:06:06,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:06,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:06:06,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:06:06,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1400aaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06, skipping insertion in model container [2024-10-13 04:06:06,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:06:06,302 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-10-13 04:06:06,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:06,373 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:06:06,384 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-18.i[915,928] [2024-10-13 04:06:06,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:06:06,435 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:06:06,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06 WrapperNode [2024-10-13 04:06:06,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:06:06,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:06,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:06:06,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:06:06,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,491 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-13 04:06:06,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:06:06,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:06:06,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:06:06,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:06:06,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,532 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:06:06,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:06:06,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:06:06,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:06:06,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:06:06,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (1/1) ... [2024-10-13 04:06:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:06:06,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:06:06,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:06:06,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:06:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:06:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:06:06,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:06:06,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:06:06,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:06:06,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:06:06,741 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:06:06,743 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:06:07,110 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 04:06:07,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:06:07,173 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:06:07,174 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:06:07,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:07 BoogieIcfgContainer [2024-10-13 04:06:07,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:06:07,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:06:07,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:06:07,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:06:07,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:06:06" (1/3) ... [2024-10-13 04:06:07,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655a121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:07, skipping insertion in model container [2024-10-13 04:06:07,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:06:06" (2/3) ... [2024-10-13 04:06:07,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655a121e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:06:07, skipping insertion in model container [2024-10-13 04:06:07,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:06:07" (3/3) ... [2024-10-13 04:06:07,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-18.i [2024-10-13 04:06:07,202 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:06:07,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:06:07,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:06:07,281 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;@4459c00c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:06:07,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:06:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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-10-13 04:06:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:06:07,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:07,298 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] [2024-10-13 04:06:07,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:07,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash -366096147, now seen corresponding path program 1 times [2024-10-13 04:06:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:07,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299759138] [2024-10-13 04:06:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:07,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:07,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:07,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:06:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:07,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:06:07,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:07,577 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 04:06:07,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:06:07,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:06:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299759138] [2024-10-13 04:06:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299759138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:06:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137116212] [2024-10-13 04:06:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:06:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:06:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:06:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:06:07,612 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:06:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:07,679 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-13 04:06:07,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:06:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 04:06:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:07,690 INFO L225 Difference]: With dead ends: 89 [2024-10-13 04:06:07,690 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 04:06:07,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:06:07,697 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:07,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:06:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 04:06:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 04:06:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-10-13 04:06:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-13 04:06:07,745 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 98 [2024-10-13 04:06:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:07,746 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-13 04:06:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 04:06:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-13 04:06:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 04:06:07,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:07,750 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] [2024-10-13 04:06:07,761 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-10-13 04:06:07,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:07,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:07,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -57785491, now seen corresponding path program 1 times [2024-10-13 04:06:07,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:07,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297688954] [2024-10-13 04:06:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:07,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:07,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:06:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:08,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:06:08,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:06:08,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:06:08,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:06:08,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297688954] [2024-10-13 04:06:08,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297688954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:08,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:06:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817366865] [2024-10-13 04:06:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:08,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:06:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:06:08,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:06:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:06:08,965 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-10-13 04:06:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:09,264 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2024-10-13 04:06:09,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:06:09,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 98 [2024-10-13 04:06:09,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:09,269 INFO L225 Difference]: With dead ends: 128 [2024-10-13 04:06:09,269 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 04:06:09,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:06:09,271 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:09,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 187 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:06:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 04:06:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2024-10-13 04:06:09,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 04:06:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2024-10-13 04:06:09,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 98 [2024-10-13 04:06:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:09,297 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2024-10-13 04:06:09,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-10-13 04:06:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2024-10-13 04:06:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:06:09,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:09,299 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] [2024-10-13 04:06:09,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:06:09,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:09,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash -773434598, now seen corresponding path program 1 times [2024-10-13 04:06:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016858997] [2024-10-13 04:06:09,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:09,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:09,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:09,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 04:06:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:09,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:06:09,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 252 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-13 04:06:10,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:06:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-13 04:06:10,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:06:10,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016858997] [2024-10-13 04:06:10,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016858997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:06:10,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:06:10,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 04:06:10,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053366108] [2024-10-13 04:06:10,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:06:10,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 04:06:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:06:10,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 04:06:10,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:06:10,918 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-13 04:06:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:12,046 INFO L93 Difference]: Finished difference Result 181 states and 249 transitions. [2024-10-13 04:06:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 04:06:12,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 99 [2024-10-13 04:06:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:12,049 INFO L225 Difference]: With dead ends: 181 [2024-10-13 04:06:12,050 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 04:06:12,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=318, Unknown=0, NotChecked=0, Total=506 [2024-10-13 04:06:12,052 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:12,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 153 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:06:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 04:06:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2024-10-13 04:06:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 62 states have internal predecessors, (71), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2024-10-13 04:06:12,100 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 99 [2024-10-13 04:06:12,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:12,101 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2024-10-13 04:06:12,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-13 04:06:12,102 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2024-10-13 04:06:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 04:06:12,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:12,106 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] [2024-10-13 04:06:12,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 04:06:12,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:12,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:12,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1582781224, now seen corresponding path program 1 times [2024-10-13 04:06:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275158462] [2024-10-13 04:06:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:12,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:12,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:12,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:12,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 04:06:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:12,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:06:12,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 04:06:23,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:06:23,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:06:23,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275158462] [2024-10-13 04:06:23,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275158462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:06:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:06:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:06:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457418674] [2024-10-13 04:06:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:06:23,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:06:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:06:23,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:06:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:06:23,426 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-10-13 04:06:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:24,172 INFO L93 Difference]: Finished difference Result 150 states and 202 transitions. [2024-10-13 04:06:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:06:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 99 [2024-10-13 04:06:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:24,176 INFO L225 Difference]: With dead ends: 150 [2024-10-13 04:06:24,177 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 04:06:24,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:06:24,178 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 59 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:24,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 282 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:06:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 04:06:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2024-10-13 04:06:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 157 transitions. [2024-10-13 04:06:24,216 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 157 transitions. Word has length 99 [2024-10-13 04:06:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:24,218 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 157 transitions. [2024-10-13 04:06:24,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-10-13 04:06:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 157 transitions. [2024-10-13 04:06:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 04:06:24,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:24,223 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] [2024-10-13 04:06:24,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 04:06:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:24,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1783769311, now seen corresponding path program 1 times [2024-10-13 04:06:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905931419] [2024-10-13 04:06:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:24,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:24,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:24,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:24,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 04:06:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:24,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:06:24,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:24,903 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-13 04:06:24,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:06:25,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:06:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905931419] [2024-10-13 04:06:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905931419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:06:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [922741072] [2024-10-13 04:06:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:25,183 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 04:06:25,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 04:06:25,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 04:06:25,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-13 04:06:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:25,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 04:06:25,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-13 04:06:25,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:06:26,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [922741072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:06:26,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:06:26,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 04:06:26,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957199055] [2024-10-13 04:06:26,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:06:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:06:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:06:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:06:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-13 04:06:26,132 INFO L87 Difference]: Start difference. First operand 113 states and 157 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:06:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:06:26,571 INFO L93 Difference]: Finished difference Result 218 states and 296 transitions. [2024-10-13 04:06:26,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 04:06:26,572 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-13 04:06:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:06:26,574 INFO L225 Difference]: With dead ends: 218 [2024-10-13 04:06:26,574 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 04:06:26,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-10-13 04:06:26,576 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 73 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:06:26,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 196 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:06:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 04:06:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2024-10-13 04:06:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 04:06:26,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2024-10-13 04:06:26,601 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 100 [2024-10-13 04:06:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:06:26,601 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2024-10-13 04:06:26,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 04:06:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2024-10-13 04:06:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 04:06:26,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:06:26,603 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] [2024-10-13 04:06:26,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-13 04:06:26,809 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 04:06:27,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:27,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:06:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:06:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1783828893, now seen corresponding path program 1 times [2024-10-13 04:06:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:06:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172862] [2024-10-13 04:06:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:06:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:06:27,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:06:27,007 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:06:27,008 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 (8)] Waiting until timeout for monitored process [2024-10-13 04:06:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:06:27,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 04:06:27,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:06:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 123 proven. 39 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-13 04:06:36,752 INFO L311 TraceCheckSpWp]: Computing backward predicates...