./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:48,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:48,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:11:48,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:48,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:48,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:48,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:48,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:48,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:48,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:48,964 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:48,964 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:48,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:48,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:48,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:48,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:48,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:48,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:48,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:11:48,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:48,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:48,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:48,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:48,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:48,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:48,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:48,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:48,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:48,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:48,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:48,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:48,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:48,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:48,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:48,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:48,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:48,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:11:48,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:11:48,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:48,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:48,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:48,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:48,974 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-11-08 23:11:49,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:49,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:49,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:49,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:49,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:49,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:11:50,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:50,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:50,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:11:50,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b231e65f2/4087c6d97ddd44389c6ef07b18619af7/FLAG7c355a78b [2024-11-08 23:11:51,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b231e65f2/4087c6d97ddd44389c6ef07b18619af7 [2024-11-08 23:11:51,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:51,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:51,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:51,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:51,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:51,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be763eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51, skipping insertion in model container [2024-11-08 23:11:51,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:51,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-08 23:11:51,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:51,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:51,367 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-08 23:11:51,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:51,409 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:51,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51 WrapperNode [2024-11-08 23:11:51,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:51,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:51,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:51,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:51,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,448 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-08 23:11:51,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:51,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:51,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:51,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:51,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:51,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:51,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:51,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:51,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:51,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (1/1) ... [2024-11-08 23:11:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:51,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:51,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:51,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:51,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:51,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:11:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:51,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:51,622 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:51,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:11:51,844 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:11:51,845 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:11:51,858 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:11:51,858 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:11:51,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:51 BoogieIcfgContainer [2024-11-08 23:11:51,858 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:11:51,861 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:11:51,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:11:51,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:11:51,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:51" (1/3) ... [2024-11-08 23:11:51,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f46eabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:51, skipping insertion in model container [2024-11-08 23:11:51,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:51" (2/3) ... [2024-11-08 23:11:51,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f46eabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:11:51, skipping insertion in model container [2024-11-08 23:11:51,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:51" (3/3) ... [2024-11-08 23:11:51,866 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:11:51,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:11:51,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:11:51,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:11:51,931 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;@6566bef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:11:51,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:11:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:11:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:11:51,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:51,944 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-11-08 23:11:51,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:51,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1997361240, now seen corresponding path program 1 times [2024-11-08 23:11:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600396226] [2024-11-08 23:11:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:11:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:11:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:11:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:11:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:11:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:11:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600396226] [2024-11-08 23:11:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600396226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:11:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130415402] [2024-11-08 23:11:52,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:52,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:11:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:11:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:52,289 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-11-08 23:11:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:52,306 INFO L93 Difference]: Finished difference Result 93 states and 158 transitions. [2024-11-08 23:11:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:11:52,308 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-11-08 23:11:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:52,314 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:11:52,314 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:11:52,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:11:52,321 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:52,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:11:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:11:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:11:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:11:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-08 23:11:52,357 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 102 [2024-11-08 23:11:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:52,358 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-08 23:11:52,358 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-11-08 23:11:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-08 23:11:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:11:52,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:52,361 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-11-08 23:11:52,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:11:52,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 925118552, now seen corresponding path program 1 times [2024-11-08 23:11:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551450450] [2024-11-08 23:11:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:11:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:11:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:11:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:11:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:11:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:11:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:11:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:11:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:11:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:11:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:11:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:11:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:11:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:11:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:11:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:11:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:11:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:11:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:11:53,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551450450] [2024-11-08 23:11:53,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551450450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:11:53,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:11:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 23:11:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024199438] [2024-11-08 23:11:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:11:53,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:11:53,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:11:53,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:11:53,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:11:53,861 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-11-08 23:11:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:11:54,068 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-11-08 23:11:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:11:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-11-08 23:11:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:11:54,070 INFO L225 Difference]: With dead ends: 116 [2024-11-08 23:11:54,070 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 23:11:54,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:11:54,072 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:11:54,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 359 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:11:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 23:11:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2024-11-08 23:11:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 23:11:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2024-11-08 23:11:54,082 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 102 [2024-11-08 23:11:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:11:54,083 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2024-11-08 23:11:54,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-11-08 23:11:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2024-11-08 23:11:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:11:54,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:11:54,085 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-11-08 23:11:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:11:54,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:11:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:11:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash -2108976808, now seen corresponding path program 1 times [2024-11-08 23:11:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:11:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558906769] [2024-11-08 23:11:54,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:11:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:11:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:11:54,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:11:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:11:54,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:11:54,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:11:54,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:11:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:11:54,157 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:11:54,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:11:54,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:11:54 BoogieIcfgContainer [2024-11-08 23:11:54,204 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:11:54,205 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:11:54,205 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:11:54,205 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:11:54,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:11:51" (3/4) ... [2024-11-08 23:11:54,207 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:11:54,208 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:11:54,208 INFO L158 Benchmark]: Toolchain (without parser) took 3074.28ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 101.1MB in the beginning and 71.6MB in the end (delta: 29.4MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,209 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:11:54,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 174.1MB. Free memory was 100.8MB in the beginning and 86.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.04ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 84.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,210 INFO L158 Benchmark]: Boogie Preprocessor took 47.32ms. Allocated memory is still 174.1MB. Free memory was 84.5MB in the beginning and 81.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,210 INFO L158 Benchmark]: RCFGBuilder took 361.62ms. Allocated memory is still 174.1MB. Free memory was 81.9MB in the beginning and 137.8MB in the end (delta: -55.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,210 INFO L158 Benchmark]: TraceAbstraction took 2343.69ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 136.8MB in the beginning and 71.6MB in the end (delta: 65.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2024-11-08 23:11:54,210 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 230.7MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:11:54,212 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 174.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 174.1MB. Free memory was 100.8MB in the beginning and 86.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.04ms. Allocated memory is still 174.1MB. Free memory was 86.8MB in the beginning and 84.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.32ms. Allocated memory is still 174.1MB. Free memory was 84.5MB in the beginning and 81.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.62ms. Allocated memory is still 174.1MB. Free memory was 81.9MB in the beginning and 137.8MB in the end (delta: -55.9MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2343.69ms. Allocated memory was 174.1MB in the beginning and 230.7MB in the end (delta: 56.6MB). Free memory was 136.8MB in the beginning and 71.6MB in the end (delta: 65.2MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 230.7MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000000; [L23] unsigned char var_1_3 = 1; [L24] signed long int var_1_4 = 8; [L25] signed long int var_1_5 = -32; [L26] signed long int var_1_9 = 100; [L27] signed long int var_1_12 = 25; [L28] signed long int var_1_13 = 63; [L29] signed long int var_1_14 = 0; [L30] signed long int var_1_15 = 0; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] signed long int last_1_var_1_9 = 100; VAL [isInitial=0, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=8, var_1_5=-32, var_1_9=100] [L67] var_1_4 = __VERIFIER_nondet_long() [L68] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L68] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L69] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=25, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L70] var_1_12 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L72] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=63, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L73] var_1_13 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L75] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L76] var_1_14 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L77] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L78] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L79] var_1_15 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L80] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L81] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L82] var_1_17 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L83] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L84] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=50, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L85] var_1_19 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L86] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L87] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=1000000000, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L101] RET updateVariables() [L102] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-8, var_1_17=-127, var_1_18=2, var_1_19=-65536, var_1_1=0, var_1_20=0, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32, var_1_9=100] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L102] RET step() [L103] CALL, EXPR property() [L93-L94] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((signed long int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((signed long int) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((signed long int) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; VAL [\result=0, isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=100, var_1_12=0, var_1_13=0, var_1_14=2147483647, var_1_15=0, var_1_16=-127, var_1_17=-127, var_1_18=-65536, var_1_19=-65536, var_1_1=0, var_1_20=-65536, var_1_3=1, var_1_4=0, var_1_5=-2, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 135 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:11:54,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.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 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:11:56,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:11:56,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:11:56,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:11:56,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:11:56,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:11:56,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:11:56,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:11:56,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:11:56,303 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:11:56,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:11:56,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:11:56,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:11:56,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:11:56,305 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:11:56,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:11:56,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:11:56,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:11:56,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:11:56,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:11:56,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:11:56,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:11:56,312 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:11:56,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:11:56,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:11:56,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:11:56,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:11:56,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:11:56,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:56,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:11:56,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:11:56,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:11:56,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:11:56,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:11:56,317 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 -> 99f1799baf7f5c9d7d37d9cf695471ea76a03c314cf5ba1feb06a277131aa58f [2024-11-08 23:11:56,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:11:56,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:11:56,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:11:56,618 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:11:56,619 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:11:56,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:11:57,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:11:58,130 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:11:58,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:11:58,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d055d19/4ac08acae7444deb94cc1da837d29155/FLAGc9a6fd7d2 [2024-11-08 23:11:58,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d055d19/4ac08acae7444deb94cc1da837d29155 [2024-11-08 23:11:58,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:11:58,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:11:58,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:58,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:11:58,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:11:58,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4bfd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58, skipping insertion in model container [2024-11-08 23:11:58,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:11:58,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-08 23:11:58,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:58,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:11:58,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-65.i[916,929] [2024-11-08 23:11:58,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:11:58,818 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:11:58,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58 WrapperNode [2024-11-08 23:11:58,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:11:58,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:58,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:11:58,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:11:58,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,856 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2024-11-08 23:11:58,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:11:58,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:11:58,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:11:58,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:11:58,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:11:58,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:11:58,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:11:58,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:11:58,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:11:58,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (1/1) ... [2024-11-08 23:11:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:11:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:11:58,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:11:58,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:11:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:11:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:11:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:11:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:11:58,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:11:58,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:11:59,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:11:59,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:12:04,227 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:12:04,228 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:12:04,242 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:12:04,242 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:12:04,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:04 BoogieIcfgContainer [2024-11-08 23:12:04,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:12:04,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:12:04,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:12:04,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:12:04,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:11:58" (1/3) ... [2024-11-08 23:12:04,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:04, skipping insertion in model container [2024-11-08 23:12:04,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:11:58" (2/3) ... [2024-11-08 23:12:04,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:12:04, skipping insertion in model container [2024-11-08 23:12:04,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:12:04" (3/3) ... [2024-11-08 23:12:04,249 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-65.i [2024-11-08 23:12:04,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:12:04,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:12:04,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:12:04,322 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;@13bf3a0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:12:04,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:12:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:12:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:12:04,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:04,337 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-11-08 23:12:04,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:04,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1997361240, now seen corresponding path program 1 times [2024-11-08 23:12:04,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:12:04,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532588958] [2024-11-08 23:12:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:04,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:12:04,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:12:04,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:12:04,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:12:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:04,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:12:04,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:12:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-08 23:12:04,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:12:04,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:12:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532588958] [2024-11-08 23:12:04,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532588958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:12:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:12:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:12:04,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179339618] [2024-11-08 23:12:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:12:04,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:12:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:12:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:12:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:12:04,603 INFO L87 Difference]: Start difference. First operand has 50 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:12:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:12:04,624 INFO L93 Difference]: Finished difference Result 93 states and 158 transitions. [2024-11-08 23:12:04,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:12:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2024-11-08 23:12:04,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:12:04,632 INFO L225 Difference]: With dead ends: 93 [2024-11-08 23:12:04,632 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:12:04,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:12:04,637 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:12:04,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:12:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:12:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:12:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:12:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-11-08 23:12:04,676 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 102 [2024-11-08 23:12:04,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:12:04,677 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-11-08 23:12:04,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:12:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-11-08 23:12:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 23:12:04,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:12:04,681 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-11-08 23:12:04,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:12:04,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:12:04,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:12:04,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:12:04,883 INFO L85 PathProgramCache]: Analyzing trace with hash 925118552, now seen corresponding path program 1 times [2024-11-08 23:12:04,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:12:04,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103246619] [2024-11-08 23:12:04,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:12:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:12:04,891 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:12:04,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:12:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:05,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:12:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:12:05,167 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-11-08 23:12:05,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1448756549] [2024-11-08 23:12:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:12:05,168 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:12:05,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:12:05,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:12:05,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 23:12:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:12:05,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 23:12:05,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:12:50,206 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:12:58,284 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:13:06,456 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:13:13,462 WARN L286 SmtUtils]: Spent 7.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:13:20,575 WARN L286 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 23:13:27,498 WARN L286 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)