./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:54:40,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:54:40,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:54:40,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:54:40,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:54:40,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:54:40,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:54:40,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:54:40,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:54:40,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:54:40,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:54:40,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:54:40,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:54:40,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:54:40,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:54:40,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:54:40,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:54:40,851 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:54:40,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:54:40,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:54:40,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:54:40,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:54:40,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:54:40,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:54:40,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:54:40,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:54:40,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:54:40,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:54:40,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:54:40,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:54:40,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:54:40,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:54:40,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:40,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:54:40,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:54:40,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:54:40,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:54:40,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:54:40,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:54:40,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:54:40,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:54:40,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:54:40,859 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 -> 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b [2024-11-20 05:54:41,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:54:41,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:54:41,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:54:41,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:54:41,128 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:54:41,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:54:42,564 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:54:42,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:54:42,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:54:42,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdab465b6/f0b8d1030922427c92d0df0357b89ff9/FLAG8b50d462a [2024-11-20 05:54:42,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdab465b6/f0b8d1030922427c92d0df0357b89ff9 [2024-11-20 05:54:42,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:54:42,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:54:42,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:42,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:54:42,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:54:42,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:42" (1/1) ... [2024-11-20 05:54:42,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e2e3d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:42, skipping insertion in model container [2024-11-20 05:54:42,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:42" (1/1) ... [2024-11-20 05:54:42,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:54:43,027 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_has-floats_file-64.i[917,930] [2024-11-20 05:54:43,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:43,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:54:43,130 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_has-floats_file-64.i[917,930] [2024-11-20 05:54:43,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:43,187 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:54:43,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43 WrapperNode [2024-11-20 05:54:43,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:43,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:43,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:54:43,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:54:43,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,270 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-20 05:54:43,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:43,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:54:43,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:54:43,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:54:43,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,313 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-20 05:54:43,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:54:43,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:54:43,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:54:43,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:54:43,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (1/1) ... [2024-11-20 05:54:43,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:54:43,377 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-20 05:54:43,383 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-20 05:54:43,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:54:43,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:54:43,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:54:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:54:43,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:54:43,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:54:43,512 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:54:43,517 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:54:43,828 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 05:54:43,829 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:54:43,843 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:54:43,844 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:54:43,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:43 BoogieIcfgContainer [2024-11-20 05:54:43,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:54:43,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:54:43,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:54:43,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:54:43,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:54:42" (1/3) ... [2024-11-20 05:54:43,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b79c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:43, skipping insertion in model container [2024-11-20 05:54:43,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:43" (2/3) ... [2024-11-20 05:54:43,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b79c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:54:43, skipping insertion in model container [2024-11-20 05:54:43,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:43" (3/3) ... [2024-11-20 05:54:43,855 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:54:43,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:54:43,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:54:43,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:54:43,928 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;@3aff0744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:54:43,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:54:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:54:43,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 05:54:43,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:43,949 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:54:43,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 245606244, now seen corresponding path program 1 times [2024-11-20 05:54:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128657355] [2024-11-20 05:54:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:43,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:54:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:54:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:54:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:54:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:54:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:54:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:54:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:54:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:54:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:54:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:54:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:54:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:54:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128657355] [2024-11-20 05:54:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128657355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:44,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:44,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:54:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469534064] [2024-11-20 05:54:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:54:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:54:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:54:44,442 INFO L87 Difference]: Start difference. First operand has 68 states, 45 states have (on average 1.4) internal successors, (63), 46 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:54:44,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:44,479 INFO L93 Difference]: Finished difference Result 129 states and 220 transitions. [2024-11-20 05:54:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:54:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-11-20 05:54:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:44,490 INFO L225 Difference]: With dead ends: 129 [2024-11-20 05:54:44,490 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 05:54:44,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-20 05:54:44,499 INFO L432 NwaCegarLoop]: 96 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, 96 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-20 05:54:44,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:54:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 05:54:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-20 05:54:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 42 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:54:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-11-20 05:54:44,626 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 128 [2024-11-20 05:54:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:44,629 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-11-20 05:54:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:54:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-11-20 05:54:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 05:54:44,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:44,635 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:54:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:54:44,636 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:44,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 465464880, now seen corresponding path program 1 times [2024-11-20 05:54:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:44,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573652956] [2024-11-20 05:54:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:45,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:54:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:54:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:54:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:54:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:54:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:54:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:54:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:54:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:54:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:54:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:54:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:54:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:54:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573652956] [2024-11-20 05:54:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573652956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:54:46,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:54:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:54:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108127066] [2024-11-20 05:54:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:54:46,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 05:54:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 05:54:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:54:46,144 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:54:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:46,980 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2024-11-20 05:54:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 05:54:46,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-11-20 05:54:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:46,987 INFO L225 Difference]: With dead ends: 301 [2024-11-20 05:54:46,988 INFO L226 Difference]: Without dead ends: 240 [2024-11-20 05:54:46,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-20 05:54:46,990 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 323 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:46,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 518 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:54:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-20 05:54:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 75. [2024-11-20 05:54:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:54:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-20 05:54:47,020 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 128 [2024-11-20 05:54:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-20 05:54:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:54:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-20 05:54:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 05:54:47,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:47,029 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:54:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:54:47,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1166529458, now seen corresponding path program 1 times [2024-11-20 05:54:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103841704] [2024-11-20 05:54:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:47,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:54:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:54:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:54:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 05:54:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 05:54:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 05:54:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 05:54:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 05:54:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 05:54:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:54:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:54:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 05:54:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:54:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 05:54:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:54:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 05:54:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:54:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:54:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:54:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 05:54:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 05:54:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:54:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103841704] [2024-11-20 05:54:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103841704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 05:54:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913206692] [2024-11-20 05:54:48,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:48,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:54:48,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:54:48,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:54:48,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:54:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:54:48,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 05:54:48,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:54:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 39 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-20 05:54:50,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:54:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 42 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-20 05:54:51,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913206692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:54:51,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 05:54:51,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 27 [2024-11-20 05:54:51,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180051603] [2024-11-20 05:54:51,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 05:54:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 05:54:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:54:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 05:54:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2024-11-20 05:54:51,510 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-20 05:54:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:54:53,099 INFO L93 Difference]: Finished difference Result 255 states and 364 transitions. [2024-11-20 05:54:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-20 05:54:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 128 [2024-11-20 05:54:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:54:53,103 INFO L225 Difference]: With dead ends: 255 [2024-11-20 05:54:53,103 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 05:54:53,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=599, Invalid=2157, Unknown=0, NotChecked=0, Total=2756 [2024-11-20 05:54:53,106 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 308 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:54:53,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 802 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 05:54:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 05:54:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 131. [2024-11-20 05:54:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.180722891566265) internal successors, (98), 83 states have internal predecessors, (98), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 05:54:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2024-11-20 05:54:53,140 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 128 [2024-11-20 05:54:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:54:53,141 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2024-11-20 05:54:53,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.7777777777777777) internal successors, (102), 27 states have internal predecessors, (102), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-20 05:54:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2024-11-20 05:54:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 05:54:53,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:54:53,145 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:54:53,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 05:54:53,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:54:53,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:54:53,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:54:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1286547333, now seen corresponding path program 1 times [2024-11-20 05:54:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:54:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793155998] [2024-11-20 05:54:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:54:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:54:53,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796800616] [2024-11-20 05:54:53,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:54:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:54:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:54:53,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:54:53,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 05:54:53,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:54:53,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:54:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:54:53,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:54:53,687 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:54:53,688 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:54:53,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:54:53,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-20 05:54:53,894 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 05:54:53,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:54:53,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:54:53 BoogieIcfgContainer [2024-11-20 05:54:53,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:54:53,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:54:53,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:54:53,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:54:53,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:54:43" (3/4) ... [2024-11-20 05:54:53,990 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:54:53,992 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:54:53,993 INFO L158 Benchmark]: Toolchain (without parser) took 11185.10ms. Allocated memory was 163.6MB in the beginning and 373.3MB in the end (delta: 209.7MB). Free memory was 93.1MB in the beginning and 225.6MB in the end (delta: -132.5MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,993 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:54:53,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.61ms. Allocated memory is still 163.6MB. Free memory was 92.9MB in the beginning and 78.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.64ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 133.2MB in the end (delta: -55.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,993 INFO L158 Benchmark]: Boogie Preprocessor took 61.87ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 133.2MB in the beginning and 183.3MB in the end (delta: -50.1MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,994 INFO L158 Benchmark]: RCFGBuilder took 510.60ms. Allocated memory is still 213.9MB. Free memory was 183.3MB in the beginning and 162.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,994 INFO L158 Benchmark]: TraceAbstraction took 10138.88ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 161.3MB in the beginning and 226.7MB in the end (delta: -65.4MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2024-11-20 05:54:53,994 INFO L158 Benchmark]: Witness Printer took 5.40ms. Allocated memory is still 373.3MB. Free memory was 226.7MB in the beginning and 225.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:54:53,996 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.17ms. Allocated memory is still 163.6MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.61ms. Allocated memory is still 163.6MB. Free memory was 92.9MB in the beginning and 78.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.64ms. Allocated memory is still 163.6MB. Free memory was 78.3MB in the beginning and 133.2MB in the end (delta: -55.0MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.87ms. Allocated memory was 163.6MB in the beginning and 213.9MB in the end (delta: 50.3MB). Free memory was 133.2MB in the beginning and 183.3MB in the end (delta: -50.1MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * RCFGBuilder took 510.60ms. Allocated memory is still 213.9MB. Free memory was 183.3MB in the beginning and 162.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10138.88ms. Allocated memory was 213.9MB in the beginning and 373.3MB in the end (delta: 159.4MB). Free memory was 161.3MB in the beginning and 226.7MB in the end (delta: -65.4MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. * Witness Printer took 5.40ms. Allocated memory is still 373.3MB. Free memory was 226.7MB in the beginning and 225.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_2 = 128; [L24] unsigned long int var_1_3 = 2941876006; [L25] unsigned long int var_1_5 = 256; [L26] float var_1_6 = 63.5; [L27] float var_1_7 = -0.151; [L28] float var_1_8 = 0.8; [L29] double var_1_9 = 9.5; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] signed short int var_1_13 = -2; [L34] unsigned char var_1_16 = 10; [L35] unsigned short int var_1_17 = 8; [L36] unsigned char var_1_18 = 16; [L37] unsigned char last_1_var_1_16 = 10; VAL [isInitial=0, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_2=128, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L115] RET updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L75] var_1_3 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L78] var_1_5 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L79] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L82] var_1_6 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_8=4/5, var_1_9=19/2] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_9=19/2] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12, var_1_9=19/2] [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L91] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L93] var_1_12 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L94] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L95] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L95] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L96] var_1_17 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L98] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L98] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=16, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L116] RET updateVariables() [L117] CALL step() [L41] signed long int stepLocal_1 = last_1_var_1_16; [L42] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=-6442450945, stepLocal_1=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L43] COND TRUE stepLocal_1 <= (var_1_3 - last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=-6442450945, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=9/10, var_1_3=-6442450945, var_1_5=12] [L44] COND FALSE !(stepLocal_0 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) [L49] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=2, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L52] COND TRUE var_1_1 < var_1_1 [L53] var_1_10 = (! (var_1_11 && var_1_12)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=2, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L55] EXPR var_1_2 & (var_1_5 / var_1_17) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L55] unsigned long int stepLocal_2 = var_1_2 & (var_1_5 / var_1_17); [L56] COND FALSE !(stepLocal_2 > var_1_3) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L108-L109] return ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=14, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=-6442450945, var_1_5=12, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 1416 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1119 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1156 IncrementalHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 297 mSDtfsCounter, 1156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 217 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2986 SizeOfPredicates, 10 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3668/3800 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-20 05:54:54,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:54:56,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:54:56,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:54:56,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:54:56,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:54:56,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:54:56,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:54:56,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:54:56,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:54:56,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:54:56,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:54:56,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:54:56,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:54:56,398 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:54:56,400 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:54:56,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:54:56,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:54:56,401 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:54:56,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:54:56,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:54:56,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:54:56,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:54:56,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:54:56,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:54:56,406 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:54:56,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:54:56,407 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:54:56,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:54:56,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:54:56,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:54:56,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:54:56,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:54:56,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:54:56,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:54:56,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:56,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:54:56,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:54:56,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:54:56,411 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:54:56,411 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:54:56,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:54:56,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:54:56,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:54:56,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:54:56,412 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 -> 55e583a0a9f7f2653eed51c0b81d821a7cc045000a63c3ac74a8989888b39b3b [2024-11-20 05:54:56,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:54:56,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:54:56,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:54:56,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:54:56,760 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:54:56,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:54:58,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:54:58,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:54:58,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:54:58,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e98e3d5f/ed62ed6282a04eabaedc982d04052bbc/FLAGe969f2402 [2024-11-20 05:54:58,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e98e3d5f/ed62ed6282a04eabaedc982d04052bbc [2024-11-20 05:54:58,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:54:58,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:54:58,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:58,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:54:58,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:54:58,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:58" (1/1) ... [2024-11-20 05:54:58,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4bbf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:58, skipping insertion in model container [2024-11-20 05:54:58,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:54:58" (1/1) ... [2024-11-20 05:54:58,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:54:59,151 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_has-floats_file-64.i[917,930] [2024-11-20 05:54:59,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:59,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:54:59,241 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_has-floats_file-64.i[917,930] [2024-11-20 05:54:59,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:54:59,311 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:54:59,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59 WrapperNode [2024-11-20 05:54:59,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:54:59,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:59,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:54:59,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:54:59,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,374 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-11-20 05:54:59,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:54:59,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:54:59,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:54:59,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:54:59,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,416 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-20 05:54:59,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:54:59,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:54:59,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:54:59,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:54:59,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (1/1) ... [2024-11-20 05:54:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:54:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:54:59,488 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-20 05:54:59,492 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-20 05:54:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:54:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:54:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:54:59,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:54:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:54:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:54:59,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:54:59,633 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:55:03,554 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:55:03,554 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:55:03,566 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:55:03,566 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:55:03,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:03 BoogieIcfgContainer [2024-11-20 05:55:03,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:55:03,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:55:03,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:55:03,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:55:03,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:54:58" (1/3) ... [2024-11-20 05:55:03,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f4892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:03, skipping insertion in model container [2024-11-20 05:55:03,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:54:59" (2/3) ... [2024-11-20 05:55:03,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9f4892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:55:03, skipping insertion in model container [2024-11-20 05:55:03,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:55:03" (3/3) ... [2024-11-20 05:55:03,578 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-64.i [2024-11-20 05:55:03,594 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:55:03,594 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:55:03,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:55:03,661 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;@10c7202f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:55:03,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:55:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:55:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 05:55:03,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:03,677 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:03,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:03,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:03,684 INFO L85 PathProgramCache]: Analyzing trace with hash -911701312, now seen corresponding path program 1 times [2024-11-20 05:55:03,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814540822] [2024-11-20 05:55:03,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:03,703 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-20 05:55:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:03,707 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-20 05:55:03,708 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-20 05:55:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:04,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:55:04,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-20 05:55:04,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:55:04,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:55:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814540822] [2024-11-20 05:55:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814540822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:04,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:55:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809028175] [2024-11-20 05:55:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:04,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:55:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:55:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:55:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:55:04,216 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:55:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:04,242 INFO L93 Difference]: Finished difference Result 111 states and 192 transitions. [2024-11-20 05:55:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:55:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-20 05:55:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:04,254 INFO L225 Difference]: With dead ends: 111 [2024-11-20 05:55:04,254 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 05:55:04,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-20 05:55:04,262 INFO L432 NwaCegarLoop]: 81 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, 81 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-20 05:55:04,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:55:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 05:55:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-20 05:55:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:55:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-20 05:55:04,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 125 [2024-11-20 05:55:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:04,300 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-20 05:55:04,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 05:55:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-20 05:55:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-20 05:55:04,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:04,303 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:04,319 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-20 05:55:04,504 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-20 05:55:04,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:04,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1717989682, now seen corresponding path program 1 times [2024-11-20 05:55:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010780228] [2024-11-20 05:55:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:04,507 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-20 05:55:04,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:04,508 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-20 05:55:04,510 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-20 05:55:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:04,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 05:55:04,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:55:27,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:55:27,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:55:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010780228] [2024-11-20 05:55:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010780228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 05:55:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722699395] [2024-11-20 05:55:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:27,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:55:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:55:27,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:55:27,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:55:27,237 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:55:30,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:55:33,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:55:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:34,020 INFO L93 Difference]: Finished difference Result 179 states and 263 transitions. [2024-11-20 05:55:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:55:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-20 05:55:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:34,055 INFO L225 Difference]: With dead ends: 179 [2024-11-20 05:55:34,055 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 05:55:34,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:55:34,057 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 69 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:55:34,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 436 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-20 05:55:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 05:55:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2024-11-20 05:55:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 05:55:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-20 05:55:34,083 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 125 [2024-11-20 05:55:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:34,083 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-20 05:55:34,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:55:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-20 05:55:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 05:55:34,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:34,086 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:34,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 05:55:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:55:34,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1482512312, now seen corresponding path program 1 times [2024-11-20 05:55:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823576779] [2024-11-20 05:55:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:34,289 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-20 05:55:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:34,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:55:34,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:55:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:34,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:55:34,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 05:55:35,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:55:35,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:55:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823576779] [2024-11-20 05:55:35,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823576779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:55:35,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:55:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:55:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22661757] [2024-11-20 05:55:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:55:35,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:55:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:55:35,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:55:35,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:55:35,282 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:55:36,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 05:55:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:55:36,788 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2024-11-20 05:55:36,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:55:36,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2024-11-20 05:55:36,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:55:36,823 INFO L225 Difference]: With dead ends: 157 [2024-11-20 05:55:36,823 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 05:55:36,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:55:36,825 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:55:36,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 05:55:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 05:55:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-20 05:55:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 05:55:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2024-11-20 05:55:36,849 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 126 [2024-11-20 05:55:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:55:36,851 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2024-11-20 05:55:36,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:55:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2024-11-20 05:55:36,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 05:55:36,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:55:36,854 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 05:55:36,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 05:55:37,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:55:37,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:55:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:55:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1447203203, now seen corresponding path program 1 times [2024-11-20 05:55:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:55:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449506805] [2024-11-20 05:55:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:55:37,057 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-20 05:55:37,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:55:37,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:55:37,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 05:55:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:55:37,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 05:55:37,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:55:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-20 05:55:57,125 INFO L311 TraceCheckSpWp]: Computing backward predicates...